Competitive Equilibria with Unequal Budgets: Supporting Arbitrary Pareto Optimal Allocations

03/15/2021
by   Nir Andelman, et al.
0

We consider a market setting of agents with additive valuations over heterogeneous divisible resources. Agents are assigned a budget of tokens (possibly unequal budgets) they can use to obtain resources; leftover tokens are worthless. We show how to support any Pareto efficient allocation in equilibrium, using anonymous resource prices and agent specific budgets. We also give computationally efficient algorithms for those tasks. In particular, this allows us to support the Rawlsian max-min allocation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/01/2018

Local Equilibria

A local equilibrium is a generalization of a Walrasian, i.e., competitiv...
research
09/15/2023

Fairly Allocating Goods in Parallel

We initiate the study of parallel algorithms for fairly allocating indiv...
research
09/18/2021

Envy-Free and Pareto-Optimal Allocations for Asymmetric Agents

We study the problem of allocating m indivisible items to n agents with ...
research
08/17/2022

Ban The Box? Information, Incentives, and Statistical Discrimination

"Banning the Box" refers to a policy campaign aimed at prohibiting emplo...
research
05/08/2019

Parallel and Distributed Algorithms for the housing allocation Problem

We give parallel and distributed algorithms for the housing allocation p...
research
06/11/2021

Online Learning of Competitive Equilibria in Exchange Economies

The sharing of scarce resources among multiple rational agents is one of...
research
02/03/2022

Multivariate Algorithmics for Eliminating Envy by Donating Goods

Fairly dividing a set of indivisible resources to a set of agents is of ...

Please sign up or login with your details

Forgot password? Click here to reset