Access the full text.
Sign up today, get DeepDyve free for 14 days.
S. Alva, V. Manjunath (2019)
Strategy?proof pareto?improvement, 181
Mustafa Afacan, Inácio Bó, Bertan Turhan (2018)
Assignment MaximizationERN: Allocative Efficiency; Cost-Benefit Analysis; Externalities (Topic)
A. Abdul, T. Sönmez (2003)
School choice: a mechanism design approach, 93
Parag Pathak, T. Sonmez (2011)
School Admissions Reform in Chicago and England: Comparing Mechanisms by Their Vulnerability to ManipulationOrganizations & Markets: Policies & Processes eJournal
U. Dur, R. Hammond, T. Morrill (2018)
Identifying the Harm of Manipulable School-Choice MechanismsAmerican Economic Journal: Economic Policy, 10
T. Andersson, L. Ehlers (2020)
Assigning refugees to landlords in Sweden: efficient, stable, and maximum matchings, 122
A. Roth, Tayfun Sönmez, M. Ünver (2004)
Pairwise Kidney ExchangeNBER Working Paper Series
J. Zhang (2023)
Strategy?proof allocation with outside option, 137
F. Kojima, Mihai Manea (2010)
AXIOMS FOR DEFERRED ACCEPTANCEEconometrica, 78
I. Ashlagi, A. Saberi, A. Shameli (2020)
Assignment mechanisms under distributional constraints, 68
A. Erdil (2014)
Strategy?proof stochastic assignment, 151
Onur Kesten (2010)
School Choice with ConsentQuarterly Journal of Economics, 125
A. Abdulkad, Y.‐K. Che, P. A. Pathak, A. E. Roth, O. Tercieux (2020)
Efficiency, justified envy, and incentives in priority?based matching, 2
A. Roth (1984)
The Evolution of the Labor Market for Medical Interns and Residents: A Case Study in Game TheoryJournal of Political Economy, 92
(2016)
Do outside options matter in matching? A new perspective on the trade-offs in student assignment,
M. Pycia, M. Ünver (2015)
Incentive Compatible Allocation and Exchange of Discrete ResourcesIO: Theory
A. Bogomolnaia, H. Moulin (2015)
Size versus fairness in the assignment problem, 90
A. Bogomolnaia, H. Moulin (2001)
A new solution to the random assignment problem, 100
A. Abdulkad, P. A. Pathak, A. E. Roth (2009)
Strategy?proofness versus efficiency in matching with indifferences: redesigning the NYC high school match, 99
D. Hirata, Yusuke Kasuya (2016)
On Stable and Strategy-Proof Rules in Matching Markets with ContractsGame Theory & Bargaining Theory eJournal
Atila Abdulkadiroglu, Parag Pathak, A. Roth, Tayfun Sönmez (2005)
The Boston Public School MatchThe American Economic Review, 95
Samson Alva, V. Manjunath (2017)
Strategy-proof Pareto-improvement under voluntary participation *
A. Abdulkad, P. A. Pathak, A. E. Roth (2005)
The New York City high school match, 95
Tommy Andersson, Lars Ehlers (2016)
Assigning refugees to landlords in Sweden: stable maximum matchings, 2016
Parag Pathak, Tayfun Sönmez (2008)
Leveling the Playing Field: Sincere and Sophisticated Players in the Boston MechanismThe American Economic Review, 98
I. Ashlagi, A. Nikzad, A. Romm (2019)
Assigning more students to their top choices: a comparison of tie?breaking rules, 115
B. Doğan, L. Ehlers (2021)
Minimally unstable Pareto improvements over deferred acceptance, 16
H. Ergin, T. Sonmez, M. U. Unver (2017)
Dual?donor organ exchange, 85
Szilvia Pápai (2000)
Strategyproof Assignment by Hierarchical ExchangeEconometrica, 68
O. Kesten, M. Kurino (2019)
Strategy?proof improvements upon deferred acceptance: a maximal domain for possibility, 117
Y. Chen, O. Kesten (2017)
Chinese college admissions and school choice reforms: a theoretical analysis, 125
B. Doğan, L. Ehlers (2022)
Robust minimal instability of the top trading cycles mechanism, 14
Lars Ehlers, B. Klaus (2016)
Object allocation via deferred-acceptance: Strategy-proofness and comparative staticsGames Econ. Behav., 97
The number of assigned agents (i.e., size) is an important parameter in object allocations. While size maximality clashes with individual rationality and strategy‐proofness, it can still be possible to increase the size over a mechanism while keeping these properties. To pursue this research, we devise a size comparison criterion to investigate the possibility of size increase. A mechanism ψ size‐wise dominates another mechanism ϕ if the latter never assigns more agents than the former, and at some problem, ψ assigns more agents than ϕ. We obtain arguably mild conditions for a mechanism to not be dominated size‐wise by an individually rational and strategy‐proof mechanism. Moreover, whenever there are at least as many objects as the total number of agents, we find conditions, different from those previously mentioned, for a mechanism to not be dominated size‐wise by an individually rational and group strategy‐proof mechanism. These results have implications for deferred‐acceptance, top trading cycles, efficiency‐adjusted deferred‐acceptance, serial dictatorship, and Boston mechanisms.
The Scandinavian Journal of Economics – Wiley
Published: Apr 1, 2023
Keywords: Equilibrium; matching; mechanism; size; strategy‐proofness
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.