English
Related papers

Related papers: Dividing goods or bads under additive utilities

200 papers

When utilities are additive, we uncovered in our previous paper (Bogomolnaia et al. "Dividing Goods or Bads under Additive Utilities") many similarities but also surprising differences in the behavior of the familiar Competitive rule (with…

Computer Science and Game Theory · Computer Science 2016-10-13 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

This paper develops a theory of competitive equilibrium with indivisible goods based entirely on economic conditions on demand. The key idea is to analyze complementarity and substitutability between bundles of goods, rather than merely…

Theoretical Economics · Economics 2024-12-12 Ravi Jagadeesan , Alexander Teytelboym

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

We study competitive equilibrium in the canonical Fisher market model, but with indivisible goods. In this model, every agent has a budget of artificial currency with which to purchase bundles of goods. Equilibrium prices match between…

Computer Science and Game Theory · Computer Science 2019-11-25 Moshe Babaioff , Noam Nisan , Inbal Talgam-Cohen

We consider the problem of allocating indivisible goods in a way that is fair, using one of the leading market mechanisms in economics: the competitive equilibrium from equal incomes. Focusing on two major classes of valuations, namely…

Computer Science and Game Theory · Computer Science 2016-07-19 Simina Brânzei , Hadi Hosseini , Peter Bro Miltersen

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

In markets with budget-constrained buyers, competitive equilibria need not be efficient in the utilitarian sense, or maximise the seller's revenue. We consider a setting with multiple divisible goods. Competitive equilibrium outcomes, and…

Theoretical Economics · Economics 2025-04-09 Simon Finster , Paul W. Goldberg , Edwin Lock

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 initiate the study of how auction design affects the division of surplus among buyers. We propose a parsimonious measure for equity and apply it to the family of standard auctions for homogeneous goods. Our surplus-equitable mechanism is…

Theoretical Economics · Economics 2024-11-14 Simon Finster , Patrick Loiseau , Simon Mauras , Mathieu Molina , Bary Pradelski

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

Equitable allocation of indivisible items involves partitioning the items among agents such that everyone derives (almost) equal utility. We consider the approximate notion of \textit{equitability up to one item} (EQ1) and focus on the…

Computer Science and Game Theory · Computer Science 2025-08-22 Hadi Hosseini , Aditi Sethia

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

We show that, with indivisible goods, the existence of competitive equilibrium fundamentally depends on agents' substitution effects, not their income effects. Our Equilibrium Existence Duality allows us to transport results on the…

Theoretical Economics · Economics 2020-07-01 Elizabeth Baldwin , Omer Edhan , Ravi Jagadeesan , Paul Klemperer , Alexander Teytelboym

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 fair division, equitability dictates that each participant receives the same level of utility. In this work, we study equitable allocations of indivisible goods among agents with additive valuations. While prior work has studied…

Computer Science and Game Theory · Computer Science 2019-05-28 Rupert Freeman , Sujoy Sikdar , Rohit Vaish , Lirong Xia

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 study fair resource allocation under a connectedness constraint wherein a set of indivisible items are arranged on a path and only connected subsets of items may be allocated to the agents. An allocation is deemed fair if it satisfies…

Computer Science and Game Theory · Computer Science 2021-01-27 Neeldhara Misra , Chinmay Sonar , P. R. Vaidyanathan , Rohit Vaish

In this paper we extend the equal division and the equal surplus division values for transferable utility cooperative games to the more general setup of transferable utility cooperative games with a priori unions. In the case of the equal…

Computer Science and Game Theory · Computer Science 2024-01-31 J. M. Alonso-Meijide , J. Costa , I. García-Jurado , J. C. Gonçalves-Dosantos

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
‹ Prev 1 2 3 10 Next ›