IDEAS home Printed from https://ideas.repec.org/a/fau/aucocz/au2009_143.html
   My bibliography  Save this article

Strategic Manipulations and Collusions in Knaster Procedure

Author

Abstract

The Knaster’s procedure is one of the simplest and most powerful mechanisms for allocating indivisible objects among agents requiring them, but its sealed bid feature may induce some agents in altering their valuations. In this paper we study the consequences of false declarations on the agents’ payoffs. A misrepresentation of a single agent could produce a gain or a loss. So, we analyze a possible behavior of a subset of infinitely risk-averse agents and propose how to obtain a safe gain via a joint misreporting of their valuations, regardless of the declarations of the other agents.

Suggested Citation

  • Vito Fragnelli & Maria Erminia Marina, 2009. "Strategic Manipulations and Collusions in Knaster Procedure," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 3(2), pages 143-153, July.
    • Handle: RePEc:fau:aucocz:au2009_143
    as

    Download full text from publisher

    File URL: http://auco.cuni.cz/mag/article/download/id/64/type/attachment
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
    2. 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.
    3. Herve Moulin, 2004. "Fair Division and Collective Welfare," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262633116, April.
    4. Lars-Gunnar Svensson, 1999. "Strategy-proof allocation of indivisible goods," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 16(4), pages 557-567.
    5. Shigehiro Serizawa, 2006. "Pairwise Strategy-Proofness and Self-Enforcing Manipulation," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 26(2), pages 305-331, April.
    6. Holmstrom, Bengt, 1979. "Groves' Scheme on Restricted Domains," Econometrica, Econometric Society, vol. 47(5), pages 1137-1144, September.
    7. Szilvia Pápai, 2003. "Groves sealed bid auctions of heterogeneous objects with fair prices," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 20(3), pages 371-385, June.
    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;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. Corradi, Corrado & Corradi, Valentina, 2010. "Strategic manipulations and collusions in Knaster procedure: a comment," MPRA Paper 28678, University Library of Munich, Germany.
    2. Federica Briata & Andrea Dall’Aglio & Marco Dall’Aglio & Vito Fragnelli, 2017. "The Shapley value in the Knaster gain game," Annals of Operations Research, Springer, vol. 259(1), pages 1-19, December.
    3. Vito Fragnelli & Gianfranco Gambarelli, 2014. "Further open problems in cooperative games," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 24(4), pages 51-62.
    4. Federica Briata & Marco Dall’Aglio & Vito Fragnelli, 2012. "Dynamic Collusion and Collusion Games in Knaster’s Procedure," Czech Economic Review, Charles University Prague, Faculty of Social Sciences, Institute of Economic Studies, vol. 6(3), pages 199-208, October.

    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. Yuji Fujinaka & Takuma Wakayama, 2011. "Secure implementation in Shapley–Scarf housing markets," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 48(1), pages 147-169, September.
    2. Miyagawa, Eiichi, 2001. "House Allocation with Transfers," Journal of Economic Theory, Elsevier, vol. 100(2), pages 329-355, October.
    3. Tommy Andersson & Lars-Gunnar Svensson, 2008. "Weakly fair allocations and strategy-proofness," Review of Economic Design, Springer;Society for Economic Design, vol. 11(4), pages 321-338, February.
    4. Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Kidney Exchange," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 119(2), pages 457-488.
    5. Erlanson, Albin & Szwagrzak, Karol, 2013. "Strategy-Proof Package Assignment," Working Papers 2013:43, Lund University, Department of Economics.
    6. Ehlers, Lars & Klaus, Bettina, 2006. "Efficient priority rules," Games and Economic Behavior, Elsevier, vol. 55(2), pages 372-384, May.
    7. Yu Zhou & Shigehiro Serizawa, 2019. "Minimum price equilibrium in the assignment market," ISER Discussion Paper 1047, Institute of Social and Economic Research, Osaka University.
    8. Sonmez, Tayfun & Utku Unver, M., 2005. "House allocation with existing tenants: an equivalence," Games and Economic Behavior, Elsevier, vol. 52(1), pages 153-185, July.
    9. Quesada, Antonio, 2009. "Allocation of objects with conditional property rights," MPRA Paper 19469, University Library of Munich, Germany.
    10. Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005. "Pairwise kidney exchange," Journal of Economic Theory, Elsevier, vol. 125(2), pages 151-188, December.
    11. Marek Pycia & Peter Troyan, 2023. "A Theory of Simplicity in Games and Mechanism Design," Econometrica, Econometric Society, vol. 91(4), pages 1495-1526, July.
    12. Monte, Daniel & Tumennasan, Norovsambuu, 2015. "Centralized allocation in multiple markets," Journal of Mathematical Economics, Elsevier, vol. 61(C), pages 74-85.
    13. Barberà, Salvador & Berga, Dolors & Moreno, Bernardo, 2010. "Individual versus group strategy-proofness: When do they coincide?," Journal of Economic Theory, Elsevier, vol. 145(5), pages 1648-1674, September.
    14. 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.
    15. Shende, Priyanka & Purohit, Manish, 2023. "Strategy-proof and envy-free mechanisms for house allocation," Journal of Economic Theory, Elsevier, vol. 213(C).
    16. Sophie Bade, 2016. "Pareto-optimal matching allocation mechanisms for boundedly rational agents," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 47(3), pages 501-510, October.
    17. Kazuhiko Hashimoto, 2018. "Strategy-proofness and identical preferences lower bound in allocation problem of indivisible objects," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 65(4), pages 1045-1078, June.
    18. Liu, Peng & Zeng, Huaxia, 2019. "Random assignments on preference domains with a tier structure," Journal of Mathematical Economics, Elsevier, vol. 84(C), pages 176-194.
    19. Ergin, Haluk I., 2000. "Consistency in house allocation problems," Journal of Mathematical Economics, Elsevier, vol. 34(1), pages 77-97, August.
    20. YIlmaz, Özgür, 2010. "The probabilistic serial mechanism with private endowments," Games and Economic Behavior, Elsevier, vol. 69(2), pages 475-491, July.

    More about this item

    Keywords

    Knaster’s procedure; misrepresentation; collusion;
    All these keywords.

    JEL classification:

    • C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General

    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:fau:aucocz:au2009_143. 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: Lenka Stastna (email available below). General contact details of provider: https://edirc.repec.org/data/icunicz.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.