On the Computational Properties of Obviously Strategy-Proof Mechanisms
Theoretical Economics
2022-10-25 v3 Computer Science and Game Theory
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
Cite
@article{arxiv.2101.05149,
title = {On the Computational Properties of Obviously Strategy-Proof Mechanisms},
author = {Louis Golowich and Shengwu Li},
journal= {arXiv preprint arXiv:2101.05149},
year = {2022}
}
Comments
working paper. Updates: added results for anonymous choice rules