On the Fair Division of a Random Object

Author:

Bogomolnaia Anna12ORCID,Moulin Hervé34ORCID,Sandomirskiy Fedor45ORCID

Affiliation:

1. Adam Smith Business School, University of Glasgow, Glasgow G12 8QQ, United Kingdom;

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

3. Adam Smith Business School, University of Glasgow, Glasgow G12 8QQ, United Kingdom

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

5. The Faculty of Industrial Engineering and Management, Technion, Haifa 3200003, Israel

Abstract

Ann likes oranges much more than apples; Bob likes apples much more than oranges. Tomorrow they will receive one fruit that will be an orange or an apple with equal probability. Giving one half to each agent is fair for each realization of the fruit. However, agreeing that whatever fruit appears will go to the agent who likes it more gives a higher expected utility to each agent and is fair in the average sense: in expectation, each agent prefers the allocation to the equal division of the fruit; that is, the agent gets a fair share. We turn this familiar observation into an economic design problem: upon drawing a random object (the fruit), we learn the realized utility of each agent and can compare it to the mean of the agent’s distribution of utilities; no other statistical information about the distribution is available. We fully characterize the division rules using only this sparse information in the most efficient possible way while giving everyone a fair share. Although the probability distribution of individual utilities is arbitrary and mostly unknown to the manager, these rules perform in the same range as the best rule when the manager has full access to this distribution. This paper was accepted by Ilia Tsetlin, behavioral economics and decision analysis.

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Strategy and Management

Reference33 articles.

1. Aleksandrov M, Aziz H, Gaspers S, Walsh T (2015) Online fair division: Analysing a food bank problem, in Yang Q, Wooldridge M, eds. Proc. 24th Internat. Joint Conf. Artificial Intelligence, (AAAI Press, Buenos Aires), 2540–2546.

2. Benade G, Kazachkov AM, Procaccia AD, Psomas A (2018) How to make envy vanish over time, in Tardos EE, ed. Proc. 2018 ACM Conf. Econom. Comput. (ACM, Ithaca, NY), 593–610.

3. On the Measurement of Inequality under Uncertainty

4. The Price of Fairness

5. On the Efficiency-Fairness Trade-off

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

1. Fair and Efficient Online Allocations;Operations Research;2023-11-03

2. Equitability and welfare maximization for allocating indivisible items;Autonomous Agents and Multi-Agent Systems;2022-12-02

3. Sequential Fair Allocation: Achieving the Optimal Envy-Efficiency Trade-off Curve;Operations Research;2022-11-23

4. Online Max-min Fair Allocation;Algorithmic Game Theory;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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