The Econometric Society An International Society for the Advancement of Economic Theory in its Relation to Statistics and Mathematics
Home Contacts
Econometrica

New Journals

Econometrica
Editorial Board
Journal News

Monograph Series

November 1991 - Volume 59 Issue 6 Page 1755 - 1767


p.1755


No-Envy and Consistency in Economies with Indivisible Goods

Koichi Tadenuma
William Thomson

Abstract

We consider the problem of fair allocation in economies with indivisible goods. Our main objective is to identify appealing subsolutions of the no-envy solution. We formulate desirable properties of solutions, and look for solutions satisfying them: given an allocation chosen by a solution for some economy and given a subgroup of the agents, consider the problem of fairly distributing among its members the resources that this group has collectively received. The solution is consistent if it recommends that the same bundle be attributed to each of these agents as initially. We show that there is no proper subsolution of the no-envy solution that satisfies consistency. However, many subsolutions satisfy bilateral consistency or the converse of consistency. But again, there is no proper subsolution satisfying these two properties together.

Full content Login                                    

Note: to view the fulltext of the article, please login first and then click the "full content" button. If you are based at a subscribing Institution or Library or if you have a separate access to JSTOR/Wiley Online Library please click on the "Institutional access" button.
Prev | All Articles | Next
Go to top
Membership



Email me my password
Join/Renew
Change your address
Register for password
Require login:
Amend your profile
E-mail Alerting
The Society
About the Society
Society News
Society Reports
Officers
Fellows
Members
Regions
Meetings
Future Meetings
Past Meetings
Meeting Announcements
Google
web this site
   
Wiley-Blackwell
Site created and maintained by Wiley-Blackwell.
Comments? Contact customsiteshelp@wiley.com
To view our Privacy Policy, please click here.