Guarantees in fair division: general or monotone preferences

Bogomolnaia, A. and Moulin, H. (2023) Guarantees in fair division: general or monotone preferences. Mathematics of Operations Research, 48(1), pp. 160-176. (doi: 10.1287/moor.2022.1255)

Abstract

When dividing a “manna” Ω of private items (commodities, workloads, land, time slots) between n agents, the individual guarantee is the welfare each agent can secure in the worst case of other agents’ preferences and actions. If the manna is nonatomic and utilities are continuous (not necessarily monotone or convex) the minmax utility, that of our agent’s best share in the agent’s worst partition of the manna, is guaranteed by Kuhn’s generalization of divide and choose. The larger maxmin utility—of the agent’s worst share in the agent’s best partition—cannot be guaranteed even for two agents. If, for all agents, more manna is better than less (or less is better than more), the new bid and choose rules offer guarantees between minmax and maxmin by letting agents bid for the smallest (or largest) size of a share they find acceptable.

• Item Type: Articles
• Status: Published
• Refereed: Yes
• Glasgow Author(s) Enlighten ID: Moulin, Professor Herve and Bogomolnaia, Professor Anna
• Authors: Bogomolnaia, A., and Moulin, H.
• College/School: College of Social Sciences > Adam Smith Business School > Economics
• Journal Name: Mathematics of Operations Research
• Publisher: INFORMS
• ISSN: 0364-765X
• ISSN (Online): 1526-5471
• Published Online: 08 April 2022
• Copyright Holders: Copyright © 2022 INFORMS
• First Published: First published in Mathematics of Operations Research 48(1): 160-176
• Publisher Policy: Reproduced in accordance with the publisher copyright policy

Related URLs

• arXiv