On the Computational Properties of Obviously Strategy-Proof Mechanisms
Louis GolowichShengwu Li
所有作者
Louis GolowichShengwu Li
文献摘要
We present a polynomial-time algorithm that determines, given some choice
rule, whether there exists an obviously strategy-proof mechanism for that
choice rule.