Presentations -
-
Essential μ-compatible subgames for obtaining a von Neumann-Morgenstern stable set in an assignment game,
Keisuke Bando, Yakuma Furusawa
The 9th International Symposium on Algorithmic Game Theory (SAGT),
2016.09,Oral presentation (general)
-
A characterization of weak Maskin monotonicity in an allocation problem with indivisible goods
Keisuke Bando, Kenzo Imamura
首都大学東京経済学セミナー,
2014.12,Public lecture, seminar, tutorial, course, or other speech
-
On the existence of a strictly strong Nash equilibrium under the student-optimal deferred acceptance algorithm
Keisuke Bando
ゲーム理論ワークショップ2014,
2014.03,Oral presentation (general)
-
A Modified Deferred Acceptance Algorithm for Many-to-One Matching Markets with Externalities among Firms
Keisuke Bando
富山大学経済学セミナー,
2013.01,Public lecture, seminar, tutorial, course, or other speech
-
A fixed point algorithm for many-to-one matching markets with externalities among firms
Keisuke Bando
UECE Lisbon Meetings Game Theory and Applications,
2012.11,Oral presentation (general)
-
A fixed point algorithm for many-to-one matching markets with externalities among firms
Keisuke Bando
日本経済学会2012年度秋季大会,
2012.10,Oral presentation (general)
-
Dynamic matching with choice functions
Keisuke Bando
ゲーム理論ワークショップ2012,
2012.03,Oral presentation (general)
-
Many-to-one matching markets with externalities of firms
Keisuke Bando
兼松フェローシップセミナー,
2011.05,Public lecture, seminar, tutorial, course, or other speech
-
Many-to-one matching markets with externalities of firms
Keisuke Bando
日本経済学会2010年度秋季大会,
2010.09,Poster presentation