Shapley–Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange

Author:

Biró Péter12ORCID,Klijn Flip34ORCID,Klimentova Xenia5ORCID,Viana Ana56ORCID

Affiliation:

1. Institute of Economics, Centre for Economic and Regional Studies, Budapest 1097, Hungary;

2. Institute of Operations and Decision Sciences, Corvinus University of Budapest, Budapest 1093, Hungary;

3. Institute for Economic Analysis (IAE-CSIC), 08193 Barcelona, Spain;

4. Barcelona School of Economics, 08005 Barcelona, Spain;

5. Institute for Systems and Computer Engineering, Technology and Science, 4200-465 Porto, Portugal;

6. Polytechnic of Porto–School of Engineering, 4249-015 Porto, Portugal

Abstract

In a housing market of Shapley and Scarf, each agent is endowed with one indivisible object and has preferences over all objects. An allocation of the objects is in the (strong) core if there exists no (weakly) blocking coalition. We show that, for strict preferences, the unique strong core allocation “respects improvement”—if an agent’s object becomes more desirable for some other agents, then the agent’s allotment in the unique strong core allocation weakly improves. We extend this result to weak preferences for both the strong core (conditional on nonemptiness) and the set of competitive allocations (using probabilistic allocations and stochastic dominance). There are no counterparts of the latter two results in the two-sided matching literature. We provide examples to show how our results break down when there is a bound on the length of exchange cycles. Respecting improvements is an important property for applications of the housing markets model, such as kidney exchange: it incentivizes each patient to bring the best possible set of donors to the market. We conduct computer simulations using markets that resemble the pools of kidney exchange programs. We compare the game-theoretical solutions with current techniques (maximum size and maximum weight allocations) in terms of violations of the respecting improvement property. We find that game-theoretical solutions fare much better at respecting improvements even when exchange cycles are bounded, and they do so at a low efficiency cost. As a stepping stone for our simulations, we provide novel integer programming formulations for computing core, competitive, and strong core allocations. Funding: P. Biró gratefully acknowledges financial support from the Hungarian Scientific Research Fund, OTKA [Grant K143858] and the Hungarian Academy of Sciences [Grant LP2021-2]. F. Klijn gratefully acknowledges financial support from AGAUR–Generalitat de Catalunya [Grants 2017-SGR-1359 and 2021-SGR-00416] and the Spanish Agencia Estatal de Investigación [Grants ECO2017-88130-P and PID2020-114251GB-I00] (funded by MCIN/AEI/10.13039/501100011033) and the Severo Ochoa Programme for Centres of Excellence in R&D (Barcelona School of Economics) [Grant CEX2019-000915-S]. Research visits related to this work were financed by COST Action [Grant CA15210 ENCKEP], supported by COST (European Cooperation in Science and Technology), http://www.cost.eu/ .

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Optimization methods and algorithms;Central European Journal of Operations Research;2024-01-16

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3