Minimizing manipulation in matching markets without outside options
Abstract In two-sided matching markets without outside options, we compare mechanisms in terms of the number of agents who can manipulate them. Despite the existence of several stable mechanisms that are strategy-proof for one side of the market, we show that there is only one such mechanism that stable-minimizes manipulation: the deferred acceptance mechanism with the short side making proposals. Surprisingly, the Boston mechanism may have fewer manipulators than any stable mechanism. We adapt our main results to markets where only one side has outside options and to many-to-one markets without outside options.
Authors
- Camilo J. Sirguiado
Institutions
- University of California, Berkeley (US)
Publication Details
- Journal
- Social Choice and Welfare
- Published
- 2026-09-29
- DOI
- https://doi.org/10.1007/s00355-026-01679-1
- Primary Topic
- Game Theory and Voting Systems
- Type
- article
- Field-Weighted Citation Impact
- 0.00