English
Related papers

Related papers: Competitive Equilibrium For Almost All Incomes: Ex…

200 papers

We introduce a model of fair division with market values, where indivisible goods must be partitioned among agents with (additive) subjective valuations, and each good additionally has a market value. The market valuation can be viewed as a…

Computer Science and Game Theory · Computer Science 2024-10-31 Siddharth Barman , Soroush Ebadian , Mohamad Latifian , Nisarg Shah

How does one allocate a collection of resources to a set of strategic agents in a fair and efficient manner without using money? For in many scenarios it is not feasible to use money to compensate agents for otherwise unsatisfactory…

Computer Science and Game Theory · Computer Science 2012-07-10 Richard Cole , Vasilis Gkatzelis , Gagan Goel

We consider item allocation to individual agents who have additive valuations, in settings in which there are protected groups, and the allocation needs to give each protected group its "fair" share of the total welfare. Informally, within…

Computer Science and Game Theory · Computer Science 2022-04-15 Uriel Feige , Yehonatan Tahan

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

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

The existence of a (partial) market equilibrium price is proved in a complete, continuous time finite-agent market setting. The economic agents act as price takers in a fully competitive setting and maximize exponential utility from…

Mathematical Finance · Quantitative Finance 2022-12-01 Alessandro Prosperi

We study a resource allocation setting where $m$ discrete items are to be divided among $n$ agents with additive utilities, and the agents' utilities for individual items are drawn at random from a probability distribution. Since common…

Computer Science and Game Theory · Computer Science 2023-03-20 Pasin Manurangsi , Warut Suksompong

Several resource allocation settings involve agents with unequal entitlements represented by weights. We analyze weighted fair division from an asymptotic perspective: if $m$ items are divided among $n$ agents whose utilities are…

Computer Science and Game Theory · Computer Science 2025-09-16 Pasin Manurangsi , Warut Suksompong , Tomohiko Yokoyama

This paper focuses on a new model to reach the existence of equilibrium in a pure exchange economy with fuzzy preferences (PXE-FP). The proposed model integrates exchange, consumption and the agent's fuzzy preference in the consumption set.…

Computer Science and Game Theory · Computer Science 2020-10-13 Xia Zhang , Hao Sun , Xuanzhu Jin , Moses Olabhele Esangbedo

Several different fairness notions have been introduced in the context of fair allocation of goods. In this manuscript, we compare between some fairness notions that are used in settings in which agents have arbitrary (perhaps unequal)…

Computer Science and Game Theory · Computer Science 2023-12-01 Uriel Feige

The two standard fairness notions in the resource allocation literature are proportionality and envy-freeness. If there are n agents competing for the available resources, then proportionality requires that each agent receives at least a…

Computer Science and Game Theory · Computer Science 2025-04-22 Arash Ashuri , Vasilis Gkatzelis

We study fair allocation of indivisible items, where the items are furnished with a set of conflicts, and agents are not permitted to receive conflicting items. This kind of constraint captures, for example, participating in events that…

Computer Science and Game Theory · Computer Science 2022-02-01 Halvard Hummel , Magnus Lie Hetland

A notion of incentive for agents is introduced which leads to a very general notion of an equilibrium for a finite game. Sufficient conditions for the existence of these equilibria are given. Known existence theorems are shown to be…

Computer Science and Game Theory · Computer Science 2013-01-04 Dashiell E. A. Fryer

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

Envy-freeness is one of the most widely studied notions in fair division. Since envy-free allocations do not always exist when items are indivisible, several relaxations have been considered. Among them, possibly the most compelling concept…

Computer Science and Game Theory · Computer Science 2021-07-27 Ryoga Mahara

In a satisficing equilibrium each agent $i$ plays one of her top $k_i$ actions in response to the actions of the other agents. Our concept unifies models of bounded rationality and yields predictions that differ from canonical solution…

Theoretical Economics · Economics 2026-04-27 Bary S. R. Pradelski , Bassel Tarbush

Fair allocation of indivisible goods is a well-explored problem. Traditionally, research focused on individual fairness - are individual agents satisfied with their allotted share? - and group fairness - are groups of agents treated fairly?…

Computer Science and Game Theory · Computer Science 2023-02-15 Jonathan Scarlett , Nicholas Teh , Yair Zick

Nash equilibrium (NE) assumes that players always make a best response. However, this is not always true; sometimes people cooperate even it is not a best response to do so. For example, in the Prisoner's Dilemma, people often cooperate.…

Computer Science and Game Theory · Computer Science 2014-12-23 Nan Rong , Joseph Y. Halpern

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

When dividing items among agents, two of the most widely studied fairness notions are envy-freeness and proportionality. We consider a setting where $m$ chores are allocated to $n$ agents and the disutility of each chore for each agent is…

Computer Science and Game Theory · Computer Science 2025-04-30 Pasin Manurangsi , Warut Suksompong