Strategic Manipulations and Collusions in Knaster Procedure
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.
Volume (Year): 3 (2009)
Issue (Month): 2 (July)
|Contact details of provider:|| Postal: |
Phone: +420 2 222112330
Fax: +420 2 22112304
Web page: http://ies.fsv.cuni.cz/Email:
More information through EDIRC
|Order Information:|| Web: http://auco.cuni.cz/ Email: |
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.:
- Lars-Gunnar Svensson, 2009.
"Coalitional strategy-proofness and fairness,"
Springer, vol. 40(2), pages 227-245, August.
- Shigehiro Serizawa, 2006.
"Pairwise Strategy-Proofness and Self-Enforcing Manipulation,"
Social Choice and Welfare,
Springer, vol. 26(2), pages 305-331, April.
- Shigehiro Serizawa, 2005. "Pairwise Strategy-Proofness and Self-Enforcing Manipulation," ISER Discussion Paper 0629, Institute of Social and Economic Research, Osaka University.
- Herve Moulin, 2004. "Fair Division and Collective Welfare," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262633116, June.
- Szilvia Pápai, 2003. "Groves sealed bid auctions of heterogeneous objects with fair prices," Social Choice and Welfare, Springer, vol. 20(3), pages 371-385, 06.
- Lars-Gunnar Svensson, 1999. "Strategy-proof allocation of indivisible goods," Social Choice and Welfare, Springer, vol. 16(4), pages 557-567.
- 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.
- Claus-Jochen Haake & Matthias G. Raith & Francis Su, 2000. "Bidding for Envy-Freeness: A Procedural Approach to n-Player Fair Division Problems," Claremont Colleges Working Papers 2000-47, Claremont Colleges.
- Holmstrom, Bengt, 1979. "Groves' Scheme on Restricted Domains," Econometrica, Econometric Society, vol. 47(5), pages 1137-44, September.
- Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lenka Stastna)
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.