English
Related papers

Related papers: Dividing goods and bads under additive utilities

200 papers

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

The classic fair division problems assume the resources to be allocated are either divisible or indivisible, or contain a mixture of both, but the agents always have a predetermined and uncontroversial agreement on the (in)divisibility of…

Computer Science and Game Theory · Computer Science 2025-03-31 Xiaohui Bei , Shengxin Liu , Xinhang Lu

We consider a fair division setting where indivisible items are allocated to agents. Each agent in the setting has strictly negative, zero or strictly positive utility for each item. We, thus, make a distinction between items that are good…

Computer Science and Game Theory · Computer Science 2020-05-14 Martin Aleksandrov

We formulate the problem of fair and efficient completion of indivisible goods, defined as follows: Given a partial allocation of indivisible goods among agents, does there exist an allocation of the remaining goods (i.e., a completion)…

Computer Science and Game Theory · Computer Science 2024-12-30 Vishwa Prakash HV , Ayumi Igarashi , Rohit Vaish

Agents vote to choose a fair mixture of public outcomes; each agent likes or dislikes each outcome. We discuss three outstanding voting rules. The Conditional Utilitarian rule, a variant of the random dictator, is Strategyproof and…

Computer Science and Game Theory · Computer Science 2017-12-08 Haris Aziz , Anna Bogomolnaia , Herve Moulin

In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is the following: at each stage, a designated agent picks one object among those that…

Computer Science and Game Theory · Computer Science 2016-04-07 Sylvain Bouveret , Michel Lemaître

We study the fair division problem of allocating $m$ indivisible goods to $n$ agents with additive personalized bi-valued utilities. Specifically, each agent $i$ assigns one of two positive values $a_i > b_i > 0$ to each good, indicating…

Computer Science and Game Theory · Computer Science 2025-10-20 Jiarong Jin , Biaoshuai Tao

Fair division is the problem of dividing one or several goods amongst two or more agents in a way that satisfies a suitable fairness criterion. These Notes provide a succinct introduction to the field. We cover three main topics. First, we…

Artificial Intelligence · Computer Science 2018-06-13 Ulle Endriss

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…

Computer Science and Game Theory · Computer Science 2021-01-12 Anna Bogomolnaia , Herve Moulin , Fedor Sandomirskiy

We study the question of existence and fast computation of fair and efficient allocations of indivisible resources among agents with additive valuations. As such allocations may not exist for arbitrary instances, we ask if they exist for…

Computer Science and Game Theory · Computer Science 2025-12-22 Aprup Kale , Rucha Kulkarni , Navya Garg

We study the fair division problem of allocating a mixed manna under additively separable piecewise linear concave (SPLC) utilities. A mixed manna contains goods that everyone likes and bads that everyone dislikes, as well as items that…

Computer Science and Game Theory · Computer Science 2020-08-07 Bhaskar Ray Chaudhury , Jugal Garg , Peter McGlaughlin , Ruta Mehta

Single minded agents have strict preferences, in which a bundle is acceptable only if it meets a certain demand. Such preferences arise naturally in scenarios such as allocating computational resources among users, where the goal is to…

Computer Science and Game Theory · Computer Science 2016-04-29 Simina Brânzei , Yuezhou Lv , Ruta Mehta

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 study the problem of fairly allocating indivisible goods among a set of agents. Our focus is on the existence of allocations that give each agent their maximin fair share--the value they are guaranteed if they divide the goods into as…

Computer Science and Game Theory · Computer Science 2024-07-19 Sirin Botan , Angus Ritossa , Mashbat Suzuki , Toby Walsh

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 study fair allocation of indivisible goods and chores among agents with \emph{lexicographic} preferences -- a subclass of additive valuations. In sharp contrast to the goods-only setting, we show that an allocation satisfying…

Computer Science and Game Theory · Computer Science 2022-03-15 Hadi Hosseini , Sujoy Sikdar , Rohit Vaish , Lirong Xia

In fair division of indivisible goods, using sequences of sincere choices (or picking sequences) is a natural way to allocate the objects. The idea is as follows: at each stage, a designated agent picks one object among those that remain.…

Artificial Intelligence · Computer Science 2018-08-01 Aurélie Beynier , Sylvain Bouveret , Michel Lemaître , Nicolas Maudet , Simon Rey

This paper establishes the existence of equilibrium in an economy with production and a continuum of consumers, each of whose incomplete and price-dependent preferences are defined on commodities they may consider deleterious, bads which…

Theoretical Economics · Economics 2025-11-04 Robert M. Anderson , Haosui Duanmu , M. Ali Khan , Metin Uyanik

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

We study the problem of allocating indivisible goods among agents with additive valuation functions to achieve both fairness and efficiency under the constraint that each agent receives exactly the same number of goods (the \emph{balanced…

Computer Science and Game Theory · Computer Science 2026-03-09 Yasushi Kawase , Ryoga Mahara