Advanced Search
MyIDEAS: Login

(Minimally) ?-Incentive Compatible Competitive Equilibria in Economies with Indivisibilities

Contents:

Author Info

  • Tommy Andersson
  • Lars Ehlers
  • Lars-Gunnar Svensson

Abstract

We consider competitive and budget-balanced allocation rules for problems where a number of indivisible objects and a fixed amount of money is allocated among a group of agents. In "small" economies, we identify under classical preferences each agent's maximal gain from manipulation. Using this result we find the competitive and budget-balanced allocation rules which are minimally manipulable for each preference profile in terms of any agent's maximal gain. If preferences are quasi-linear, then we can find a competitive and budget-balanced allocation rule such that for any problem, the maximal utility gain from manipulation is equalized among all 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.
File URL: http://www.cireqmontreal.com/wp-content/uploads/cahiers/04-2012-cah.pdf
Download Restriction: no

Bibliographic Info

Paper provided by Centre interuniversitaire de recherche en économie quantitative, CIREQ in its series Cahiers de recherche with number 04-2012.

as in new window
Length: 16 pages
Date of creation: 2012
Date of revision:
Handle: RePEc:mtl:montec:04-2012

Contact details of provider:
Postal: C.P. 6128, Succ. centre-ville, Montréal (PQ) H3C 3J7
Phone: (514) 343-6557
Fax: (514) 343-7221
Email:
Web page: http://www.cireq.umontreal.ca
More information through EDIRC

Related research

Keywords: ?-Incentive Compatibility; Competitive Allocation; Budget-Balance; Indivisibilities;

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. Ning Sun & Zaifu Yang, 2003. "A General Strategy Proof Fair Allocation Mechanism," Working Papers 346, Bielefeld University, Center for Mathematical Economics.
  2. Aumann, Robert J. & Maschler, Michael, 1985. "Game theoretic analysis of a bankruptcy problem from the Talmud," Journal of Economic Theory, Elsevier, vol. 36(2), pages 195-213, August.
  3. Kovalenkov, Alexander, 2002. "Simple Strategy-Proof Approximately Walrasian Mechanisms," Journal of Economic Theory, Elsevier, vol. 103(2), pages 475-487, April.
  4. Paula Jaramillo & Çagtay Kayi & Flip Klijn, 2012. "Asymmetrically Fair Rules for an Indivisible Good Problem with a Budget Constraint," DOCUMENTOS CEDE 009425, UNIVERSIDAD DE LOS ANDES-CEDE.
  5. Sun, Ning & Yang, Zaifu, 2003. "A general strategy proof fair allocation mechanism," Economics Letters, Elsevier, vol. 81(1), pages 73-79, October.
  6. Stefan Maus & Hans Peters & Ton Storcken, 2007. "Minimal manipulability: anonymity and unanimity," Social Choice and Welfare, Springer, vol. 29(2), pages 247-269, September.
  7. Thomson, William, 2003. "Axiomatic and game-theoretic analysis of bankruptcy and taxation problems: a survey," Mathematical Social Sciences, Elsevier, vol. 45(3), pages 249-297, July.
  8. 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.
  9. Flip Klijn, 2000. "An algorithm for envy-free allocations in an economy with indivisible objects and money," Social Choice and Welfare, Springer, vol. 17(2), pages 201-215.
  10. Maus,Stefan & Peters,Hans & Storcken,Ton, 2005. "Anonymous voting and minimal manipulability," Research Memorandum 009, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  11. Parag A. Pathak & Tayfun Sönmez, 2011. "School Admissions Reform in Chicago and England: Comparing Mechanisms by their Vulnerability to Manipulation," Boston College Working Papers in Economics 784, Boston College Department of Economics.
  12. 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.
  13. Andersson, Tommy & Svensson, Lars-Gunnar, 2008. "Non-manipulable assignment of individuals to positions revisited," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 350-354, November.
  14. Claus-Jochen Haake & Matthias G. Raith & Francis Edward Su, 2002. "Bidding for envy-freeness: A procedural approach to n-player fair-division problems," Social Choice and Welfare, Springer, vol. 19(4), pages 723-749.
  15. Jackson, Matthew O., 1992. "Incentive compatibility and competitive allocations," Economics Letters, Elsevier, vol. 40(3), pages 299-302, November.
  16. Lars-Gunnar Svensson, 2009. "Coalitional strategy-proofness and fairness," Economic Theory, Springer, vol. 40(2), pages 227-245, August.
  17. Toru Hokari & William Thomson, 2003. "Claims problems and weighted generalizations of the Talmud rule," Economic Theory, Springer, vol. 21(2), pages 241-261, 03.
  18. Roberts, Donald John & Postlewaite, Andrew, 1976. "The Incentives for Price-Taking Behavior in Large Exchange Economies," Econometrica, Econometric Society, vol. 44(1), pages 115-27, January.
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, Tommy & Svensson, Lars-Gunnar & Ehlers, Lars, 2010. "Budget-Balance, Fairness and Minimal Manipulability," Working Papers 2010:16, Lund University, Department of Economics, revised 15 Jan 2013.

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:mtl:montec:04-2012. 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: (Sharon BREWER).

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.