Fairness in Auctions and Task Assignments
AbstractWe study the problem of allocating objects when monetary transfers are possible. We are interested in mechanisms that allocate the objects in an efficient way and induce the agents to report their true preferences. Within the class of such mechanisms, fist we characterize egalitarian-equivalent mechanisms. Then, we add a bounded-deficit condition and characterize the corresponding class. Finally, we investigate the relations between egalitarian- equivalence and other fairness notions such as no-envy.
Download InfoIf 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.
Bibliographic InfoPaper provided by University of Adelaide, School of Economics in its series School of Economics Working Papers with number 2009-27.
Length: 20 pages
Date of creation: 2009
Date of revision:
allocation of indivisible goods and money; fair auctions; task assignments; strategy-proofness; the Vickrey-Clarke-Groves mechanisms; order preservation; egalitarian-equivalence; no-envy; egalitarianism;
Find related papers by JEL classification:
- C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other
- D61 - Microeconomics - - Welfare Economics - - - Allocative Efficiency; Cost-Benefit Analysis
- D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Murat Atlamaz & Duygu Yengin, 2008. "Fair Groves mechanisms," Social Choice and Welfare, Springer, vol. 31(4), pages 573-587, December.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Dmitriy Kvasov).
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.