Advanced Search
MyIDEAS: Login to save this article or follow this journal

Non-manipulable assignment of individuals to positions revisited

Contents:

Author Info

  • Andersson, Tommy
  • Svensson, Lars-Gunnar

Abstract

This paper investigates an allocation rule that fairly assigns at most one indivisible object and a monetary compensation to each agent, under the restriction that the monetary compensations do not exceed some exogenously given upper bound. A few properties of this allocation rule are stated and the main result demonstrates that the allocation rule is coalitionally strategy-proof.

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.
File URL: http://www.sciencedirect.com/science/article/B6V88-4SKB392-1/2/65747f12eb534a047032e683f86713df
Download Restriction: Full text for ScienceDirect subscribers only

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 Elsevier in its journal Mathematical Social Sciences.

Volume (Year): 56 (2008)
Issue (Month): 3 (November)
Pages: 350-354

as in new window
Handle: RePEc:eee:matsoc:v:56:y:2008:i:3:p:350-354

Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/505565

Related research

Keywords: Indivisibles Fairness Coalitionally strategy-proofness;

Other versions of this item:

Find related papers by JEL classification:

References

References listed on IDEAS
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.:
as in new window
  1. Sun, Ning & Yang, Zaifu, 2003. "A general strategy proof fair allocation mechanism," Economics Letters, Elsevier, vol. 81(1), pages 73-79, October.
  2. Alkan, Ahmet & Demange, Gabrielle & Gale, David, 1991. "Fair Allocation of Indivisible Goods and Criteria of Justice," Econometrica, Econometric Society, vol. 59(4), pages 1023-39, July.
  3. Tadenuma, Koichi & Thomson, William, 1991. "No-Envy and Consistency in Economies with Indivisible Goods," Econometrica, Econometric Society, vol. 59(6), pages 1755-67, November.
  4. Demange, Gabrielle & Gale, David, 1985. "The Strategy Structure of Two-sided Matching Markets," Econometrica, Econometric Society, vol. 53(4), pages 873-88, July.
  5. Demange, Gabrielle & Gale, David & Sotomayor, Marilda, 1986. "Multi-Item Auctions," Journal of Political Economy, University of Chicago Press, vol. 94(4), pages 863-72, August.
  6. Svensson, Lars-Gunnar, 1983. "Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness," Econometrica, Econometric Society, vol. 51(4), pages 939-54, July.
  7. Ning Sun & Zaifu Yang, 2003. "A General Strategy Proof Fair Allocation Mechanism," Working Papers 346, Bielefeld University, Center for Mathematical Economics.
Full references (including those not matched with items on IDEAS)

Citations

Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
as in new window

Cited by:
  1. Tommy Andersson & Lars Ehlers & Lars-Gunnar Svensson, 2012. "(Minimally) ?-Incentive Compatible Competitive Equilibria in Economies with Indivisibilities," Cahiers de recherche 04-2012, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
  2. Tommy Andersson & Christer Andersson, 2012. "Properties of the DGS-Auction Algorithm," Computational Economics, Society for Computational Economics, vol. 39(2), pages 113-133, February.
  3. ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Cahiers de recherche 18-2010, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
  4. Paula Jaramillo, 2012. "Asymmetrically Fair Rules for an Indivisible Good Problem with a Budget Constraint," DOCUMENTOS CEDE 009425, UNIVERSIDAD DE LOS ANDES-CEDE.
  5. Andersson, T.D. & Andersson, C. & Talman, A.J.J., 2010. "Sets in Excess Demand in Ascending Auctions with Unit-Demand Bidders," Discussion Paper 2010-51, Tilburg University, Center for Economic Research.
  6. Andersson, Tommy & Gudmundsson, Jens & Talman, Dolf & Yang, Zaifu, 2014. "A competitive partnership formation process," Games and Economic Behavior, Elsevier, vol. 86(C), pages 165-177.
  7. Svensson, Lars-Gunnar, 2006. "Coalition Strategy-Proofness and Fairness," Working Papers 2006:10, Lund University, Department of Economics.
  8. Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2012. "Least Manipulable Envy-free Rules in Economies with Indivisibilities," Working Papers 2012:8, Lund University, Department of Economics, revised 30 Sep 2013.
  9. Tommy Andersson & Lars‐Gunnar Svensson, 2014. "Non‐Manipulable House Allocation With Rent Control," Econometrica, Econometric Society, vol. 82(2), pages 507-539, 03.
  10. Tommy Andersson & Christer Andersson, 2009. "Solving House Allocation Problems with Risk-Averse Agents," Computational Economics, Society for Computational Economics, vol. 33(4), pages 389-401, May.
  11. Tommy Andersson, 2009. "A general strategy-proof fair allocation mechanism revisited," Economics Bulletin, AccessEcon, vol. 29(3), pages 1717-1722.

Lists

This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.

Statistics

Access and download statistics

Corrections

When requesting a correction, please mention this item's handle: RePEc:eee:matsoc:v:56:y:2008:i:3:p:350-354. See general information about how to correct material in RePEc.

For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).

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.