中文
相关论文

相关论文: Egalitarian Price of Fairness for Indivisible Good…

200 篇论文

Fair allocation of indivisible items among agents is a fundamental and extensively studied problem. However, fairness does not have a single universally accepted definition, leading to a variety of competing fairness notions. Some of these…

计算机科学与博弈论 · 计算机科学 2025-10-14 Jugal Garg , Eklavya Sharma

Envy-freeness is one of the most prominent fairness concepts in the allocation of indivisible goods. Even though trivial envy-free allocations always exist, rich literature shows this is not true when one additionally requires some…

计算机科学与博弈论 · 计算机科学 2025-02-19 Robert Bredereck , Andrzej Kaczmarczyk , Junjie Luo , Bin Sun

A number of goods are called identical if they provide the same level of utility to each agent. In various real-world instances of fair division scenarios, identical indivisible items are allocated to consumers and demandants with different…

最优化与控制 · 数学 2026-05-28 Manouchehr Zaker

We study the allocation of indivisible items that form an undirected graph and investigate the worst-case welfare loss when requiring that each agent must receive a connected subgraph. Our focus is on both egalitarian and utilitarian…

计算机科学与博弈论 · 计算机科学 2026-01-21 Xiaohui Bei , Alexander Lam , Xinhang Lu , Warut Suksompong

Many fairness criteria constrain the policy or choice of predictors, which can have unwanted consequences, in particular, when optimizing the policy under such constraints. Here, we advocate to instead focus on the utility function the…

机器学习 · 统计学 2025-03-19 Frederik Hytting Jørgensen , Sebastian Weichwald , Jonas Peters

The allocation of resources among multiple agents is a fundamental problem in both economics and computer science. In these settings, fairness plays a crucial role in ensuring social acceptability and practical implementation of resource…

计算机科学与博弈论 · 计算机科学 2025-06-11 Hadi Hosseini , Joshua Kavner , Samarth Khanna , Sujoy Sikdar , Lirong Xia

We study market mechanisms for allocating divisible goods to competing agents with quasilinear utilities. For \emph{linear} pricing (i.e., the cost of a good is proportional to the quantity purchased), the First Welfare Theorem states that…

计算机科学与博弈论 · 计算机科学 2020-09-22 Ashish Goel , Benjamin Plaut

The Nash social welfare (NSW) is a well-known social welfare measurement that balances individual utilities and the overall efficiency. In the context of fair allocation of indivisible goods, it has been shown by Caragiannis et al. (EC 2016…

计算机科学与博弈论 · 计算机科学 2020-12-08 Xiaowei Wu , Bo Li , Jiarui Gan

Allocating items in a fair and economically efficient manner is a central problem in fair division. We study this problem for agents with additive preferences, when items are all goods or all chores, divisible or indivisible. The celebrated…

计算机科学与博弈论 · 计算机科学 2026-02-13 Owen Eckart , Alexandros Psomas , Paritosh Verma

A review of the main fairness definitions and fair learning methodologies proposed in the literature over the last years is presented from a mathematical point of view. Following our independence-based approach, we consider how to build…

机器学习 · 统计学 2020-05-29 Eustasio del Barrio , Paula Gordaliza , Jean-Michel Loubes

Fairness and efficiency have become the pillars of modern fair division research, but prior work on achieving both simultaneously is largely limited to the unconstrained setting. We study fair and efficient allocations of indivisible goods…

计算机科学与博弈论 · 计算机科学 2024-11-04 Benjamin Cookson , Soroush Ebadian , Nisarg Shah

We consider the problem of fair allocation of indivisible items to agents that have arbitrary entitlements to the items. Every agent $i$ has a valuation function $v_i$ and an entitlement $b_i$, where entitlements sum up to~1. Which…

计算机科学与博弈论 · 计算机科学 2024-05-24 Moshe Babaioff , Uriel Feige

Although approximate notions of envy-freeness-such as envy-freeness up to one good (EF1)-have been extensively studied for indivisible goods, the seemingly simpler fairness concept of proportionality up to one good (PROP1) has received far…

计算机科学与博弈论 · 计算机科学 2025-08-19 Martin Jupakkal Andersen , Ioannis Caragiannis , Anders Bo Ipsen , Alexander Søltoft

We draw attention to an important, yet largely overlooked aspect of evaluating fairness for automated decision making systems---namely risk and welfare considerations. Our proposed family of measures corresponds to the long-established…

人工智能 · 计算机科学 2019-01-14 Hoda Heidari , Claudio Ferrari , Krishna P. Gummadi , Andreas Krause

A seller is pricing identical copies of a good to a stream of unit-demand buyers. Each buyer has a value on the good as his private information. The seller only knows the empirical value distribution of the buyer population and chooses the…

计算机科学与博弈论 · 计算机科学 2023-05-12 Siddhartha Banerjee , Kamesh Munagala , Yiheng Shen , Kangning Wang

We study the problem of fairly allocating a multiset $M$ of $m$ indivisible items among $n$ agents with additive valuations. Specifically, we introduce a parameter $t$ for the number of distinct types of items and study fair allocations of…

计算机科学与博弈论 · 计算机科学 2023-03-30 Pranay Gorantla , Kunal Marwaha , Santhoshini Velusamy

Envy-freeness up to any good (EFX) is a central fairness notion for allocating indivisible goods, yet its existence is unresolved in general. In the setting with few surplus items, where the number of goods exceeds the number of agents by a…

计算机科学与博弈论 · 计算机科学 2026-01-21 Eugene Lim , Tzeh Yuan Neoh , Nicholas Teh

Current methodologies in machine learning analyze the effects of various statistical parity notions of fairness primarily in light of their impacts on predictive accuracy and vendor utility loss. In this paper, we propose a new framework…

机器学习 · 计算机科学 2018-07-04 Lily Hu , Yiling Chen

We study the interplay of fairness, welfare, and equity considerations in personalized pricing based on customer features. Sellers are increasingly able to conduct price personalization based on predictive modeling of demand conditional on…

机器学习 · 计算机科学 2020-12-29 Nathan Kallus , Angela Zhou

We consider a multi-agent resource allocation setting in which an agent's utility may decrease or increase when an item is allocated. We take the group envy-freeness concept that is well-established in the literature and present stronger…

计算机科学与博弈论 · 计算机科学 2019-07-23 Haris Aziz , Simon Rey