arrow
Return

Strategy-Proofness Made Simpler

delete2024-12-24
delete1
PRE
AI
P
Peter Katuščák
T
Thomas Kittsteiner *
DOI:10.1287/mnsc.2023.02531delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
There is evidence that many people do not report their types truthfully in strategy-proof mechanisms. One of the leading explanations is mechanism complexity. We propose a novel way of describing any strategy-proof mechanism with the aim to reduce the ensuing cognitive load on players and, hence, to increase truthful reporting. The description highlights that a player is guaranteed to obtain a most preferred feasible allocation based on her reported type and that feasibility depends only on the other players' reports. Optimality of truthful reporting should therefore become more apparent. We experimentally test this prediction using the top trading cycles mechanism for matching applicants to positions. The proposed description increases truth-telling. This increase positively interacts with subject numeracy.
Keywords:
market design
strategy-proofness
cognitive limitation
experiment
school choice
auction

Journal

Management Science cover
Management Science
IF:
4.9
Papers:
780
Citations:
5.0W

Organization

R
Rhein Westfal TH Aachen
Scholars:
1.4K
Papers: 589
Citations: 190
Cited Papers

Cited Papers

The Limits of Incentives in Economic Matching Procedures
err2021-02-01
err0
PREAI
errAvinatan Hassidim; Assaf Romm; Ran I. Shorrer
errShare
errSave
Stable Matching with Mistaken Agents
err2023-05-01
err0
errOAAI
errGeorgy Artemov; Yeon-Koo Che; YingHua He
errShare
errSave
errShare
errSave
Loss aversion in strategy-proof school-choice mechanisms
err2023-01-01
err0
errOAAI
errVincent Meisner; Jonas von Wangenheim
errShare
errSave
researcher View more