On the Computational Properties of Obviously Strategy-Proof Mechanisms

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.

working paper. Updates: added results for anonymous choice rules

References in corpus (2)

• Bayesian Algorithmic Mechanism Design
• Classification of Priorities Such That Deferred Acceptance is Obviously Strategyproof

Cited by in corpus (1)

• Classification of Priorities Such That Deferred Acceptance is Obviously Strategyproof