English
Related papers

Related papers: Egalitarian Price of Fairness for Indivisible Good…

200 papers

We investigate the efficiency of fair allocations of indivisible goods using the well-studied price of fairness concept. Previous work has focused on classical fairness notions such as envy-freeness, proportionality, and equitability.…

Computer Science and Game Theory · Computer Science 2021-09-08 Xiaohui Bei , Xinhang Lu , Pasin Manurangsi , Warut Suksompong

In the allocation of resources to a set of agents, how do fairness guarantees impact the social welfare? A quantitative measure of this impact is the price of fairness, which measures the worst-case loss of social welfare due to fairness…

Computer Science and Game Theory · Computer Science 2020-11-03 Siddharth Barman , Umang Bhaskar , Nisarg Shah

In fair division problems, the notion of price of fairness measures the loss in welfare due to a fairness constraint. Prior work on the price of fairness has focused primarily on envy-freeness up to one good (EF1) as the fairness…

Computer Science and Game Theory · Computer Science 2023-07-14 Umang Bhaskar , Neeldhara Misra , Aditi Sethia , Rohit Vaish

Incorporating fairness criteria in optimization problems comes at a certain cost, which is measured by the so-called price of fairness. Here we consider the allocation of indivisible goods. For envy-freeness as fairness criterion it is…

Computer Science and Game Theory · Computer Science 2014-06-24 Sascha Kurz

We study a participatory budgeting problem of aggregating the preferences of agents and dividing a budget over the projects. A budget division solution is a probability distribution over the projects. The main purpose of our study concerns…

Computer Science and Game Theory · Computer Science 2020-11-02 Zhongzheng Tang , Chenhao Wang , Mengqi Zhang

We study fair division of indivisible goods in a single-parameter environment. In particular, we develop truthful social welfare maximizing mechanisms for fairly allocating indivisible goods. Our fairness guarantees are in terms of solution…

Computer Science and Game Theory · Computer Science 2019-01-29 Siddharth Barman , Ganesh Ghalme , Shweta Jain , Pooja Kulkarni , Shivika Narang

In this work, we revisit the problem of fairly allocating a number of indivisible items that are located on a line to multiple agents. A feasible allocation requires that the allocated items to each agent are connected on the line. The…

Computer Science and Game Theory · Computer Science 2022-05-24 Ankang Sun , Bo Li

We consider the task of assigning indivisible goods to a set of agents in a fair manner. Our notion of fairness is Nash social welfare, i.e., the goal is to maximize the geometric mean of the utilities of the agents. Each good comes in…

Data Structures and Algorithms · Computer Science 2019-05-13 Bhaskar Chaudhury , Yun Kuen Cheung , Jugal Garg , Naveen Garg , Martin Hoefer , Kurt Mehlhorn

We consider two models of fair division with indivisible items: one for goods and one for bads. For goods, we study two generalized envy freeness proxies (EF1 and EFX for goods) and three common welfare (utilitarian, egalitarian and Nash)…

Computer Science and Game Theory · Computer Science 2018-08-28 Martin Aleksandrov

We study the fair allocation problem of indivisible items with subsidy. In this paper, we focus on the notion of fairness - equitability (EQ), which requires that items be allocated such that all agents value the bundle they receive…

Computer Science and Game Theory · Computer Science 2025-09-10 Yuanyuan Wang , Tianze Wei

We study the efficiency of fair allocations using the well-studied price of fairness concept, which quantitatively measures the worst-case efficiency loss when imposing fairness constraints. Previous works provided partial results on the…

Computer Science and Game Theory · Computer Science 2024-01-04 Zihao Li , Shengxin Liu , Xinhang Lu , Biaoshuai Tao , Yichen Tao

We study a fair allocation problem of indivisible items under additive externalities in which each agent also receives values from items that are assigned to other agents. We propose several new fairness concepts. We extend the well-studied…

Computer Science and Game Theory · Computer Science 2022-12-01 Haris Aziz , Warut Suksompong , Zhaohong Sun , Toby Walsh

We study the fundamental problem of allocating indivisible goods to agents with additive preferences. We consider eliciting from each agent only a ranking of her $k$ most preferred goods instead of her full cardinal valuations. We…

Computer Science and Game Theory · Computer Science 2021-05-25 Daniel Halpern , Nisarg Shah

Allocating resources to individuals in a fair manner has been a topic of interest since the ancient times, with most of the early rigorous mathematical work on the problem focusing on infinitely divisible resources. Recently, there has been…

Computer Science and Game Theory · Computer Science 2022-03-07 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros A. Voudouris

Fair allocation of indivisible goods studies allocating $m$ goods among $n$ agents in a fair manner. While fairness is a fundamental requirement in many real-world applications, it often conflicts with (economic) efficiency. This raises a…

Computer Science and Game Theory · Computer Science 2025-06-03 Xiaolin Bu , Zihao Li , Shengxin Liu , Jiaxin Song , Biaoshuai Tao

Allocating indivisible goods is a ubiquitous task in fair division. We study additive welfarist rules, an important class of rules which choose an allocation that maximizes the sum of some function of the agents' utilities. Prior work has…

Computer Science and Game Theory · Computer Science 2026-03-04 Karen Frilya Celine , Warut Suksompong , Sheung Man Yuen

In the allocation of indivisible goods, the maximum Nash welfare (MNW) rule, which chooses an allocation maximizing the product of the agents' utilities, has received substantial attention for its fairness. We characterize MNW as the only…

Theoretical Economics · Economics 2022-12-20 Warut Suksompong

We adopt a parametric approach to analyze the worst-case degradation in social welfare when the allocation of indivisible goods is constrained to be fair. Specifically, we are concerned with cardinality-constrained allocations, which…

Computer Science and Game Theory · Computer Science 2025-01-06 Alexander Lam , Bo Li , Ankang Sun

We consider the problem of fairly allocating a combination of divisible and indivisible goods. While fairness criteria like envy-freeness (EF) and proportionality (PROP) can always be achieved for divisible goods, only their relaxed…

Computer Science and Game Theory · Computer Science 2024-04-30 Bo Li , Zihao Li , Shengxin Liu , Zekai Wu

We consider the classic problem of fairly allocating indivisible goods among agents with additive valuation functions and explore the connection between two prominent fairness notions: maximum Nash welfare (MNW) and envy-freeness up to any…

Computer Science and Game Theory · Computer Science 2022-09-12 Georgios Amanatidis , Georgios Birmpas , Aris Filos-Ratsikas , Alexandros Hollender , Alexandros A. Voudouris
‹ Prev 1 2 3 10 Next ›