Envy-Free and Efficient Minimal Rights: Recursive No-Envy
Abstract
In economics the main efficiency criterion is that of Pareto-optimality. For problems of distributing a social endowment a central notion of fairness is no-envy (each agent should receive a bundle at least as good, according to her own preferences, as any of the other agent's bundle). For most economies there are multiple allocations satisfying these two properties. We provide a procedure, based on distributional implications of these two properties, which selects a single allocation which is Pareto-optimal and satisfies no-envy in two-agent exchange economies. There is no straightforward generalization of our procedure to more than two-agents.Download Info
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Bibliographic Info
Article provided by De Gruyter in its journal The B.E. Journal of Theoretical Economics.
Volume (Year): 9 (2009)
Issue (Month): 1 ()
Pages: 6
Contact details of provider:
Web page: http://www.degruyter.com
Order Information:
Web: http://www.degruyter.com/view/j/bejte
Related research
Keywords: no-envy; fair allocation; recursive methods; exchange economies;Find related papers by JEL classification:
- D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
- D74 - Microeconomics - - Analysis of Collective Decision-Making - - - Conflict; Conflict Resolution; Alliances
References
No references listed on IDEASYou can help add them by filling out this form.
Citations
Lists
This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.Statistics
Access and download statisticsCorrections
When requesting a correction, please mention this item's handle: RePEc:bpj:bejtec:v:9:y:2009:i:1:n:6For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Peter Golla).
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.

