An algorithm for envy-free allocations in an economy with indivisible objects and money
نویسنده
چکیده
This paper studies envy-free allocations for economies with indivisible objects, quasilinear utility functions, and an amount of money. We give a polynomially bounded algorithm for finding envy-free allocations. Connectedness of envy-graphs, which are used in the algorithm, characterizes the extreme points of the polytopes of sidepayments corresponding with envy-free allocations. Classification number (J.E.L.): D63.
منابع مشابه
Balancedness of permutation games and envy-free allocations in indivisible good economies
We present a simple proof of the balancedness of permutation games. In the proof we use the existence of envy-free allocations in economies with indivisible objects, quasi-linear utility functions, and an amount of money. 2000 Elsevier Science S.A. All rights reserved.
متن کاملRental harmony with roommates
We prove existence of envy-free allocations in markets with heterogenous indivisible goods and money, when a given quantity is supplied from each of the goods and agents have unit demands. We depart from most of the previous literature by allowing agents’ preferences over the goods to depend on the entire vector of prices. Our proof uses Shapley’s K-K-M-S theorem and Hall’s marriage lemma. We t...
متن کاملFairness under Uncertainty with Indivisibilities
I analyze an economy with uncertainty in which a set of indivisible objects and a certain amount of money is to be distributed among agents. The set of intertemporally fair social choice functions based on envy-freeness and Pareto efficiency is characterized. I give a necessary and sufficient condition for its non-emptiness and propose a mechanism that implements the set of intertemporally fair...
متن کاملManipulation Games in Economics with Indivisible Goods
In this paper we study the strategic aspects of the No-Envy solution for the problem of allocating a nite set of indivisible goods among a group of agents when monetary compensations are possible. In the rst part of the paper we consider the case where each agent receives, at most, one indivisible good. We prove that the set of equilibrium allocations of any direct revelation game associated ...
متن کاملMarket Mechanisms for Fair Division with Indivisible Objects and Money∗
A fair division problem with indivisible objects and money consists of a set of agents, a set of objects, a value matrix which shows the value of each agent for each object and a money endowment to be shared among agents. Each agent has a quasi-linear utility function over objects and money. A solution to a fair division problem is an allocation which assigns an object and a money share to each...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Social Choice and Welfare
دوره 17 شماره
صفحات -
تاریخ انتشار 2000