English
Related papers

Related papers: Dividing goods and bads under additive utilities

200 papers

We compare the Egalitarian Equivalent and the Competitive Equilibrium with Equal Incomes rules to divide a bundle of goods (heirlooms) or a bundle of bads (chores). For goods the Competitive division fares better, as it is Resource…

Computer Science and Game Theory · Computer Science 2017-06-06 Anna Bogomolnaia , Herve Moulin , Fedor Sandomirskiy , Elena Yanovskaya

A mixed manna contains goods (that everyone likes), bads (that everyone dislikes), as well as items that are goods to some agents, but bads or satiated to others. If all items are goods and utility functions are homothetic, concave (and…

Computer Science and Game Theory · Computer Science 2017-02-03 Anna Bogomolnaia , Herve Moulin , Fedor Sandomirskiy , Elena Yanovskaya

We consider the problem of fairly dividing a set of items. Much of the fair division literature assumes that the items are `goods' i.e., they yield positive utility for the agents. There is also some work where the items are `chores' that…

Computer Science and Game Theory · Computer Science 2021-03-18 Haris Aziz , Ioannis Caragiannis , Ayumi Igarashi , Toby Walsh

We study the chore division problem where a set of agents needs to divide a set of chores (bads) among themselves fairly and efficiently. We assume that agents have linear disutility (cost) functions. Like for the case of goods, competitive…

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

Fair division has long been an important problem in the economics literature. In this note, we consider the existence of proportionally fair allocations of indivisible goods, i.e., allocations of indivisible goods in which every agent gets…

Computer Science and Game Theory · Computer Science 2019-08-19 Warut Suksompong

Fair division considers the allocation of scarce resources among agents in such a way that every agent gets a fair share. It is a fundamental problem in society and has received significant attention and rapid developments from the game…

Computer Science and Game Theory · Computer Science 2024-08-13 Shengxin Liu , Xinhang Lu , Mashbat Suzuki , Toby Walsh

We consider the problem of fairly and efficiently allocating indivisible items (goods or bads) under capacity constraints. In this setting, we are given a set of categorized items. Each category has a capacity constraint (the same for all…

Computer Science and Game Theory · Computer Science 2023-03-01 Hila Shoshan , Erel Segal-Halevi , Noam Hazon

A set of objects is to be divided fairly among agents with different tastes, modeled by additive utility-functions. If we consider the objects as indivisible, many instances of the decision problem: ``Is there a fair division of the objects…

Computer Science and Game Theory · Computer Science 2025-07-03 Samuel Bismuth , Ivan Bliznets , Erel Segal-Halevi

Inheritances, divorces or liquidations of companies require common assets to be divided among the entitled parties. Legal methods usually consider the market value of goods, while fair division theory takes into account the parties'…

Computer Science and Game Theory · Computer Science 2023-05-10 Marco Dall'Aglio

We study the problem of allocating divisible bads (chores) among multiple agents with additive utilities when monetary transfers are not allowed. The competitive rule is known for its remarkable fairness and efficiency properties in the…

Computer Science and Game Theory · Computer Science 2023-07-18 Simina Brânzei , Fedor Sandomirskiy

In standard fair division models, we assume that all agents are selfish. However, in many scenarios, division of resources has a direct impact on the whole group or even society. Therefore, we study fair allocations of indivisible items…

Computer Science and Game Theory · Computer Science 2025-11-13 Argyris Deligkas , Eduard Eiben , Tiger-Lily Goldsmith , Dušan Knop , Šimon Schierreich

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…

Computer Science and Game Theory · Computer Science 2025-02-19 Robert Bredereck , Andrzej Kaczmarczyk , Junjie Luo , Bin Sun

We divide efficiently a pile of indivisible goods in common property, using cash transfers to ensure fairness among agents with utility linear in money. We compare three cognitively feasible and privacy preserving division rules in terms of…

Theoretical Economics · Economics 2025-07-03 Anna Bogomolnaia , Herve Moulin

A collection of objects, some of which are good and some are bad, is to be divided fairly among agents with different tastes, modeled by additive utility functions. If the objects cannot be shared, so that each of them must be entirely…

Computer Science and Game Theory · Computer Science 2022-11-10 Fedor Sandomirskiy , Erel Segal-Halevi

The fair allocation of mixed goods, consisting of both divisible and indivisible goods, has been a prominent topic of study in economics and computer science. We define an allocation as fair if its utility vector minimizes a symmetric…

Computer Science and Game Theory · Computer Science 2024-07-10 Yasushi Kawase , Koichi Nishimura , Hanna Sumita

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

In this paper, we consider the problem of fair division of indivisible goods when the allocation of goods impacts society. Specifically, we introduce a second valuation function for each agent, determining the social impact of allocating a…

Computer Science and Game Theory · Computer Science 2024-12-20 Michele Flammini , Gianluigi Greco , Giovanna Varricchio

An individually costly act that benefits all group members is a public good. Natural selection favors individual contribution to public goods only when some benefit to the individual offsets the cost of contribution. Problems of sex ratio,…

Populations and Evolution · Quantitative Biology 2011-12-16 Steven A. Frank

We study the classic divide-and-choose method for equitably allocating divisible goods between two players who are rational, self-interested Bayesian agents. The players have additive values for the goods. The prior distributions on those…

Computer Science and Game Theory · Computer Science 2024-10-22 Jamie Tucker-Foltz , Richard Zeckhauser

This paper considers a novel variant of the online fair division problem involving multiple agents in which a learner sequentially observes an indivisible item that has to be irrevocably allocated to one of the agents while satisfying a…

Machine Learning · Computer Science 2025-05-30 Arun Verma , Indrajit Saha , Makoto Yokoo , Bryan Kian Hsiang Low
‹ Prev 1 2 3 10 Next ›