Obvious strategyproofness
![]() | This article may be too technical for most readers to understand.(July 2025) |
![]() | It has been suggested that this article be merged into Strategyproofness. (Discuss) Proposed since July 2025. |
In mechanism design, obvious strategyproofness (OSP) is a strengthening of strategyproofness that captures a robustness of strategyproofness to cognitively-limited agents.[1]
Definition
[edit]Informally, a strategyproof mechanism is obviously strategyproof if the strategyproofness is robust to agents who don't understand or don't trust that their actions won't affect other players' actions.
The formal definition uses the extensive form formulation of a mechanism. It compares pairs of strategies by considering the possible trajectories from an earliest information set where they diverge. A strategy obviously dominates another strategy if, starting from each earliest information set where they diverge, the worst possible outcome for is better than the worst possible outcome for .
Examples
[edit]The sealed-bid second-price auction is strategyproof but not obviously strategyproof because bidders have to trust that their bids remain sealed.[2][3] In contrast, the ascending clock auction is obviously strategyproof,[1] even though for fully rational agents the two auctions are equivalent.
Other examples of strategyproof but not obviously strategyproof mechanisms include:
- Majority vote between two alternatives;
- Deferred acceptance[4]
- Top trading cycles
References
[edit]- ^ a b Li, Shengwu (2017-11-01). "Obviously Strategy-Proof Mechanisms". American Economic Review. 107 (11): 3257–3287. doi:10.1257/aer.20160425. ISSN 0002-8282.
- ^ Akbarpour, Mohammad; Li, Shengwu (2017). "Credible Mechanism Design". SSRN Electronic Journal. doi:10.2139/ssrn.3033208. ISSN 1556-5068. SSRN 3033208.
- ^ Komo, Andrew; Kominers, Scott Duke; Roughgarden, Tim (2025-07-02). "Shill-Proof Auctions". Proceedings of the 26th ACM Conference on Economics and Computation. EC '25. New York, NY, USA: Association for Computing Machinery. p. 784. doi:10.1145/3736252.3742623. ISBN 979-8-4007-1943-1.
- ^ Ashlagi, Itai; Gonczarowski, Yannai A. (2018-09-01). "Stable matching mechanisms are not obviously strategy-proof". Journal of Economic Theory. 177: 405–425. doi:10.1016/j.jet.2018.07.001. ISSN 0022-0531.