On the Computational Properties of Obviously Strategy-Proof Mechanisms

16 Pages Posted: 12 Feb 2021

See all articles by Shengwu Li

Shengwu Li

Harvard University - Society of Fellows

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

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

Shengwu Li (Contact Author)

Harvard University - Society of Fellows ( email )

Cambridge, MA
United States

Do you have a job opening that you would like to promote on SSRN?

Paper statistics

Downloads
10
Abstract Views
64
PlumX Metrics