Advanced Search
MyIDEAS: Login

Non-manipulable Assignment of Individuals to Positions Revisited

Contents:

Author Info

  • Andersson, Tommy

    () (Department of Economics, Lund University)

  • Svensson, Lars-Gunnar

    () (Department of Economics, Lund University)

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

To our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.

Bibliographic Info

Paper provided by Lund University, Department of Economics in its series Working Papers with number 2006:11.

as in new window
Length: 11 pages
Date of creation: 03 May 2006
Date of revision: 12 Apr 2007
Publication status: Published as Andersson, Tommy and Lars-Gunnar Svensson, 'Non-manipulable Assignment of Individuals to Positions Revisited' in Mathematical Social Sciences, 2008, pages 350-354.
Handle: RePEc:hhs:lunewp:2006_011

Contact details of provider:
Postal: Department of Economics, School of Economics and Management, Lund University, Box 7082, S-220 07 Lund,Sweden
Phone: +46 +46 222 0000
Fax: +46 +46 2224613
Web page: http://www.nek.lu.se/
More information through EDIRC

Related research

Keywords: Indivisible objects; fairness; coalitionally strategy-proofness;

Other versions of this item:

Find related papers by JEL classification:

This paper has been announced in the following NEP Reports:

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. Ning Sun & Zaifu Yang, 2003. "A General Strategy Proof Fair Allocation Mechanism," Working Papers 346, Bielefeld University, Center for Mathematical Economics.
  2. Tadenuma, Koichi & Thomson, William, 1991. "No-Envy and Consistency in Economies with Indivisible Goods," Econometrica, Econometric Society, vol. 59(6), pages 1755-67, November.
  3. Demange, Gabrielle & Gale, David, 1985. "The Strategy Structure of Two-sided Matching Markets," Econometrica, Econometric Society, vol. 53(4), pages 873-88, July.
  4. Sun, Ning & Yang, Zaifu, 2003. "A general strategy proof fair allocation mechanism," Economics Letters, Elsevier, vol. 81(1), pages 73-79, October.
  5. 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.
  6. 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.
  7. 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.
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. 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.
  2. Paula Jaramillo & Çagatay Kayi & Flip Klijn, 2012. "Asymmetrically Fair Rules for an Indivisible Good Problem with a Budget Constraint," Working Papers 610, Barcelona Graduate School of Economics.
  3. Andersson, Tommy & Svensson, Lars-Gunnar, 2012. "Non-Manipulable House Allocation with Rent Control," Working Papers 2012:18, Lund University, Department of Economics.
  4. Andersson, T. & Gudmundsson, J. & Talman, A.J.J. & Yang, Z., 2013. "A Competitive Partnership Formation Process," Discussion Paper 2013-008, Tilburg University, Center for Economic Research.
  5. Andersson , Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2012. "e-Incentive Compatible Competitive Equilibria in Economies with Indivisibilities," Working Papers 2012:8, Lund University, Department of Economics.
  6. 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.
  7. 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.
  8. Tommy Andersson, 2009. "A general strategy-proof fair allocation mechanism revisited," Economics Bulletin, AccessEcon, vol. 29(3), pages 1717-1722.
  9. Tommy Andersson & Christer Andersson, 2012. "Properties of the DGS-Auction Algorithm," Computational Economics, Society for Computational Economics, vol. 39(2), pages 113-133, February.

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:hhs:lunewp:2006_011

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

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.