Rationalizable implementation in finite mechanisms
We prove that the Maskin monotonicity condition (by Bergemann, Morris, and Tercieux (2011)) fully characterizes exact rationalizable implementation in an environ-ment with lotteries and transfers. Different from previous papers, our approach possesses many appealing features simultaneously, e.g., in...
Saved in:
Main Authors: | CHEN, Yi-Chun, KUNIMOTO, Takashi, SUN, Yifei, XIONG, Siyang |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2020
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/soe_research/2355 https://ink.library.smu.edu.sg/cgi/viewcontent.cgi?article=3354&context=soe_research |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Rationalizable implementation in finite mechanisms
by: Chen, Y-C, et al.
Published: (2021) -
Rationalizable implementation of correspondences
by: KUNIMOTO, Takashi, et al.
Published: (2019) -
Maskin meets Abreu and Matsushima
by: CHEN, Yi-Chun, et al.
Published: (2022) -
Interim rationalizable implementation of functions
by: KUNIMOTO, Takashi, et al.
Published: (2020) -
Interim rationalizable implementation of functions
by: KUNIMOTO, Takashi, et al.
Published: (2023)