Legal Assignments and Fast EADAM with Consent via Classic Theory of Stable Matchings

Author:

Faenza Yuri1ORCID,Zhang Xuan1ORCID

Affiliation:

1. Department of Industrial Engineering and Operations Research, Columbia University, New York, New York 10027

Abstract

Since the seminal work of Gale and Shapley, stable assignments have received widespread attention for their mathematical elegance and broad applicability. However, in applications such as the school choice problem, in which public schools are often perceived as commodities and only students’ welfare matters, enforcing stability implies a loss of efficiency for the students. In “Legal assignments and fast EADAM with consent via classical theory of stable matchings,” Faenza and Zhang study two extensions of the traditional model—legal assignments and efficiency adjusted deferred acceptance mechanism (EADAM)—that strive to regain this loss in efficiency. The authors establish a tight connection between legal and stable assignments, which allows them to use critical structural tools of stable matchings, such as the concept of rotations, to design provably fast algorithms for (1) optimizing linear functions over the set of legal assignments and (2) finding the outcome of EADAM. These algorithmic results greatly improve the applicability of both extensions as witnessed by a complexity analysis and experimental results.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications

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

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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