On the Computational Properties of Obviously Strategy-Proof Mechanisms

01/13/2021

∙

by   Louis Golowich, et al.

∙

0

∙

share

We present a polynomial-time algorithm that determines, given some choice rule, whether there exists an obviously strategy-proof mechanism for that choice rule.