Guarantees in Fair Division: General or Monotone Preferences

نویسندگان

چکیده

When dividing a “manna” ? of private items (commodities, workloads, land, time slots) between n agents, the individual guarantee is welfare each agent can secure in worst case other agents’ preferences and actions. If manna nonatomic utilities are continuous (not necessarily monotone or convex) minmax utility, that our agent’s best share partition manna, guaranteed by Kuhn’s generalization divide choose. The larger maxmin utility—of partition—cannot be even for two agents. If, all more better than less (or more), new bid choose rules offer guarantees letting agents smallest largest) size they find acceptable. Funding: A. Bogomolnaia H. Moulin acknowledge support from Basic Research Program National University Higher School Economics. Moulin’s research was also supported Chaire Blaise Pascal Region Ile-de-France, 2020-21.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Competitive Fair Division under linear preferences

The fair division of a bundle of goods (manna) among agents with heterogenous preferences is an important challenge for normative economic analysis. The difficulty is to combine effi ciency (Pareto optimality) with some convincing notion of fairness. When agents are responsible for their ordinal preferences, and cardinal measures of utility are not relevant, the division rule favored by economi...

متن کامل

Dynamic Fair Division Problem with General Valuations

In this paper, we focus on how to dynamically allocate a divisible resource fairly among n players who arrive and depart over time. The players may have general heterogeneous valuations over the resource. It is known that the exact envy-free and proportional allocations may not exist in the dynamic setting [21]. Thus, we will study to what extent we can guarantee the fairness in the dynamic set...

متن کامل

Fair Division*

Properties of discrete cake-cutting procedures that use a minimal number of cuts (n – 1 if there are n players) are analyzed. None is always envy-free or efficient, but divideand-conquer (D&C) minimizes the maximum number of players that any single player may envy. It works by asking n ≥ 2 players successively to place marks on a cake that divide it into equal or approximately equal halves, the...

متن کامل

Fair Division with General Equilibrium Effects and International Climate Politics

This paper introduces a solution for the fair division of common property resources in production economies with multiple inputs and outputs. It is derived from complementing the Walrasian solution by welfare bounds, whose ethical justification rests on commonality of ownership. We then apply this solution to the question of burden sharing in the climate change regime, using an intertemporal co...

متن کامل

Online Fair Division

Hunger is a major problem even in developed countries like Australia. We are working with a social startup, Foodbank Local, and local charities at distributing donated food more efficiently. This food must first be allocated to these charities and then delivered to the end customers. This fair division problem is interesting as it combines traditional features with a number of dimensions that a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Operations Research

سال: 2023

ISSN: ['0364-765X', '1526-5471']

DOI: https://doi.org/10.1287/moor.2022.1255