Rationalizable implementation in finite mechanisms
We prove that the Maskin monotonicity condition (proposed by Bergemann et al. (2011)) fully characterizes exact rationalizable implementation in an environment with lotteries and transfers. Different from previous papers, our approach possesses many appealing features simultaneously, e.g., finite me...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | text |
| Language: | English |
| Published: |
Institutional Knowledge at Singapore Management University
2021
|
| Subjects: | |
| Online Access: | https://ink.library.smu.edu.sg/soe_research/2531 https://ink.library.smu.edu.sg/context/soe_research/article/3530/viewcontent/Rationalizable_Implementation_Jun_12_2021.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Singapore Management University |
| Language: | English |