Download This PaperOn the Computational Properties of Obviously Strategy-Proof Mechanisms
16 Pages Posted: 12 Feb 2021
Date Written: December 12, 2020
Abstract
We present a polynomial-time algorithm that determines, given some choice rule, whether there exists an obviously strategy-proof mechanism for that choice rule.
Keywords: mechanism design, algorithms, strategy-proof
JEL Classification: D44, D82
Suggested Citation: Suggested Citation
Li, Shengwu, On the Computational Properties of Obviously Strategy-Proof Mechanisms (December 12, 2020). Available at SSRN: https://ssrn.com/abstract=3747819 or http://dx.doi.org/10.2139/ssrn.3747819
Do you have a job opening that you would like to promote on SSRN?
Feedback
Feedback to SSRN
If you need immediate assistance, call 877-SSRNHelp (877 777 6435) in the United States, or +1 212 448 2500 outside of the United States, 8:30AM to 6:00PM U.S. Eastern, Monday - Friday.