Advanced Search
MyIDEAS: Login to save this paper or follow this series

An algorithm for identifying agent-k-linked allocations in economies with indivisibilities

Contents:

Author Info

  • ANDERSSON, Tommy
  • EHLERS, Lars

Abstract

We consider envy-free (and budget-balanced) rules that are least manipulable with respect to agents counting or with respect to utility gains. Recently it has been shown that for any profile of quasi-linear preferences, the outcome of any such least manipulable envy-free rule can be obtained via agent-k-linked allocations. This note provides an algorithm for identifying agent-k-linked allocations.

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: https://papyrus.bib.umontreal.ca/xmlui/handle/1866/10313
Download Restriction: no

Bibliographic Info

Paper provided by Universite de Montreal, Departement de sciences economiques in its series Cahiers de recherche with number 2013-12.

as in new window
Length: 8 pages
Date of creation: 2013
Date of revision:
Handle: RePEc:mtl:montde:2013-12

Contact details of provider:
Postal: CP 6128, Succ. Centre-Ville, Montréal, Québec, H3C 3J7
Phone: (514) 343-6540
Fax: (514) 343-5831
Web page: http://www.sceco.umontreal.ca
More information through EDIRC

Related research

Keywords: Least manipulable envy-free rules; algorithm;

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. 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.
  2. Ehlers, Lars & Svensson, Lars-Gunnar & Andersson, Tommy, 0. "Budget-balance, fairness and minimal manipulability," Theoretical Economics, Econometric Society.
  3. Lars-Gunnar Svensson, 2009. "Coalitional strategy-proofness and fairness," Economic Theory, Springer, vol. 40(2), pages 227-245, August.
  4. Velez, Rodrigo A., 2011. "Are incentives against economic justice?," Journal of Economic Theory, Elsevier, vol. 146(1), pages 326-345, January.
  5. 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.
  6. 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).
  7. Maus,Stefan & Peters,Hans & Storcken,Ton, 2004. "Minimal Manipulability: Anonymity and Unanimity," Research Memorandum 026, Maastricht University, Maastricht Research School of Economics of Technology and Organization (METEOR).
  8. 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.
  9. 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

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:montde:2013-12. 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.