Efficient Fair Division with Minimal Sharing

Author:

Sandomirskiy Fedor12ORCID,Segal-Halevi Erel3ORCID

Affiliation:

1. Department of Humanities and Social Sciences, California Institute of Technology (Caltech), Pasadena, California 91125;

2. International Laboratory of Game Theory and Decision Making, Higher School of Economics, St. Petersburg 194100, Russia;

3. Computer Science Department, Ariel University, Ariel 40700, Israel

Abstract

When assets are to be divided among several partners, for example, a partnership split, fair division theory can be used to determine a fair allocation. The applicability of existing approaches is limited as they either treat assets as divisible resources that end up being shared among participants or deal with indivisible objects providing only approximate fairness. In practice, sharing is often possible but undesirable, and approximate fairness is not adequate, particularly for highly valuable assets. In “Efficient Fair Division with Minimal Sharing,” Sandomirskiy and Segal-Halevi introduce a novel approach offering a middle ground: the number of shared objects is minimized while maintaining exact fairness and economic efficiency. This minimization can be conducted in polynomial time for generic instances if the number of agents or objects is fixed. Experiments on real data demonstrate a substantial improvement over current methods.

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. Multivariate algorithmics for eliminating envy by donating goods;Autonomous Agents and Multi-Agent Systems;2024-09-09

2. Fair Division with Bounded Sharing: Binary and Non-degenerate Valuations;Lecture Notes in Computer Science;2024

3. A Survey on Fair Allocation of Chores;Mathematics;2023-08-21

4. Algorithms for Competitive Division of Chores;Mathematics of Operations Research;2023-05-10

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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