IDEAS home Printed from https://ideas.repec.org/p/mtl/montec/17-2013.html
   My bibliography  Save this paper

An Algorithm for Identifying Agent-k-Linked Allocations in Economies with Indivisibilities

Author

Listed:
  • Tommy ANDERSSON
  • Lars EHLERS

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.

Suggested Citation

  • Tommy ANDERSSON & Lars EHLERS, 2013. "An Algorithm for Identifying Agent-k-Linked Allocations in Economies with Indivisibilities," Cahiers de recherche 17-2013, Centre interuniversitaire de recherche en économie quantitative, CIREQ.
    • Handle: RePEc:mtl:montec:17-2013
    as

    Download full text from publisher

    File URL: http://www.cireqmontreal.com/wp-content/uploads/cahiers/17-2013-cah.pdf
    Download Restriction: no
    ---><---

    Other versions of this item:

    References listed on IDEAS

    as
    1. Stefan Maus & Hans Peters & Ton Storcken, 2007. "Minimal manipulability: anonymity and unanimity," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 29(2), pages 247-269, September.
    2. Svensson, Lars-Gunnar, 1983. "Large Indivisibles: An Analysis with Respect to Price Equilibrium and Fairness," Econometrica, Econometric Society, vol. 51(4), pages 939-954, July.
    3. Maus, Stefan & Peters, Hans & Storcken, Ton, 2007. "Anonymous voting and minimal manipulability," Journal of Economic Theory, Elsevier, vol. 135(1), pages 533-544, July.
    4. Lars-Gunnar Svensson, 2009. "Coalitional strategy-proofness and fairness," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 40(2), pages 227-245, August.
    5. , & , & ,, 2014. "Budget-balance, fairness and minimal manipulability," Theoretical Economics, Econometric Society, vol. 9(3), September.
    6. Parag A. Pathak & Tayfun Sönmez, 2013. "School Admissions Reform in Chicago and England: Comparing Mechanisms by Their Vulnerability to Manipulation," American Economic Review, American Economic Association, vol. 103(1), pages 80-106, February.
    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-1039, July.
    8. Tadenuma Koichi & Thomson William, 1995. "Games of Fair Division," Games and Economic Behavior, Elsevier, vol. 9(2), pages 191-204, May.
    9. Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2014. "Least manipulable Envy-free rules in economies with indivisibilities," Mathematical Social Sciences, Elsevier, vol. 69(C), pages 43-49.
    10. Tadenuma, Koichi & Thomson, William, 1993. "The fair allocation of an indivisible good when monetary compensations are possible," Mathematical Social Sciences, Elsevier, vol. 25(2), pages 117-132, February.
    11. Tadenuma, Koichi & Thomson, William, 1991. "No-Envy and Consistency in Economies with Indivisible Goods," Econometrica, Econometric Society, vol. 59(6), pages 1755-1767, November.
    12. Flip Klijn, 2000. "An algorithm for envy-free allocations in an economy with indivisible objects and money," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 17(2), pages 201-215.
    13. Velez, Rodrigo A., 2011. "Are incentives against economic justice?," Journal of Economic Theory, Elsevier, vol. 146(1), pages 326-345, January.
    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;The Society for Social Choice and Welfare, vol. 19(4), pages 723-749.
    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


    Cited by:

    1. Rodrigo A. Velez, 2017. "Equitable rent division," Working Papers 20170818-001, Texas A&M University, Department of Economics.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. , & , & ,, 2014. "Budget-balance, fairness and minimal manipulability," Theoretical Economics, Econometric Society, vol. 9(3), September.
    2. Tommy Andersson & Lars Ehlers, 2022. "An algorithm for identifying least manipulable envy‐free and budget‐balanced allocations in economies with indivisibilities," International Journal of Economic Theory, The International Society for Economic Theory, vol. 18(1), pages 50-60, March.
    3. Andersson, Tommy & Ehlers, Lars & Svensson, Lars-Gunnar, 2014. "Least manipulable Envy-free rules in economies with indivisibilities," Mathematical Social Sciences, Elsevier, vol. 69(C), pages 43-49.
    4. Fujinaka, Yuji & Wakayama, Takuma, 2015. "Maximal manipulation of envy-free solutions in economies with indivisible goods and money," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 165-185.
    5. 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.
    6. ANDERSSON, Tommy & EHLERS, Lars & SVENSSON, Lars-Gunnar, 2012. "(Minimally) 'epsilon'-Incentive Compatible Competitive Equilibria in Economies with Indivisibilities," Cahiers de recherche 2012-03, Universite de Montreal, Departement de sciences economiques.
    7. Rodrigo A. Velez, 2017. "Equitable rent division," Working Papers 20170818-001, Texas A&M University, Department of Economics.
    8. Rodrigo A. Velez, 2019. "Expressive mechanisms for equitable rent division on a budget," Papers 1902.02935, arXiv.org, revised Apr 2020.
    9. Rodrigo A. Velez, 2017. "Sharing an increase of the rent fairly," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 59-80, January.
    10. Nicolò, Antonio & Velez, Rodrigo A., 2017. "Divide and compromise," Mathematical Social Sciences, Elsevier, vol. 90(C), pages 100-110.
    11. Velez, Rodrigo A., 2023. "Equitable rent division on a soft budget," Games and Economic Behavior, Elsevier, vol. 139(C), pages 1-14.
    12. Thomson, William, 2011. "Chapter Twenty-One - Fair Allocation Rules," Handbook of Social Choice and Welfare, in: K. J. Arrow & A. K. Sen & K. Suzumura (ed.), Handbook of Social Choice and Welfare, edition 1, volume 2, chapter 21, pages 393-506, Elsevier.
    13. Velez, Rodrigo A., 2015. "Sincere and sophisticated players in an equal-income market," Journal of Economic Theory, Elsevier, vol. 157(C), pages 1114-1129.
    14. , & ,, 2015. "Strategy-proofness and efficiency with non-quasi-linear preferences: a characterization of minimum price Walrasian rule," Theoretical Economics, Econometric Society, vol. 10(2), May.
    15. Rodrigo A. Velez, 2022. "A polynomial algorithm for maxmin and minmax envy-free rent division on a soft budget," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 59(1), pages 93-118, July.
    16. Bochet, Olivier & Sakai, Toyotaka, 2007. "Strategic manipulations of multi-valued solutions in economies with indivisibilities," Mathematical Social Sciences, Elsevier, vol. 53(1), pages 53-68, January.
    17. Duygu Yengin, 2017. "No-envy and egalitarian-equivalence under multi-object-demand for heterogeneous objects," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 48(1), pages 81-108, January.
    18. Azacis, Helmuts, 2008. "Double implementation in a market for indivisible goods with a price constraint," Games and Economic Behavior, Elsevier, vol. 62(1), pages 140-154, January.
    19. Brown, Alexander L. & Velez, Rodrigo A., 2016. "The costs and benefits of symmetry in common-ownership allocation problems," Games and Economic Behavior, Elsevier, vol. 96(C), pages 115-131.
    20. Johannes Brustle & Jack Dippel & Vishnu V. Narayan & Mashbat Suzuki & Adrian Vetta, 2019. "One Dollar Each Eliminates Envy," Papers 1912.02797, arXiv.org.

    More about this item

    Keywords

    least manipulable envy-free rules; algorithm;

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
    • D63 - Microeconomics - - Welfare Economics - - - Equity, Justice, Inequality, and Other Normative Criteria and Measurement
    • D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
    • D78 - Microeconomics - - Analysis of Collective Decision-Making - - - Positive Analysis of Policy Formulation and Implementation

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:mtl:montec:17-2013. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sharon BREWER (email available below). General contact details of provider: https://edirc.repec.org/data/cdmtlca.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.