On the Computational Properties of Obviously Strategy-Proof Mechanisms

• Tác giả: Louis Golowich, Shengwu Li
• Ngôn ngữ: eng
• Ký hiệu phân loại: 511.36 Proof theory and constructive mathematics
• Thông tin xuất bản: 2021
• Bộ sưu tập: Metadata
• ID: 165984

Tóm tắt

Comment: working paper. Updates: added results for anonymous choice rulesWe present a polynomial-time algorithm that determines, given some choice rule, whether there exists an obviously strategy-proof mechanism for that choice rule.