Strategic Manipulations and Collusions in Knaster Procedure
Download full text from publisher
References listed on IDEAS
- Szilvia Papai, 2000. "Strategyproof Assignment by Hierarchical Exchange," Econometrica, Econometric Society, vol. 68(6), pages 1403-1434, November.
- 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.
- Herve Moulin, 2004. "Fair Division and Collective Welfare," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262633116, December.
- 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.
- 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.
- Shigehiro Serizawa, 2005. "Pairwise Strategy-Proofness and Self-Enforcing Manipulation," ISER Discussion Paper 0629, Institute of Social and Economic Research, Osaka University.
- Holmstrom, Bengt, 1979. "Groves' Scheme on Restricted Domains," Econometrica, Econometric Society, vol. 47(5), pages 1137-1144, September.
- 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.
- 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.
CitationsCitations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
- Corradi, Corrado & Corradi, Valentina, 2010. "Strategic manipulations and collusions in Knaster procedure: a comment," MPRA Paper 28678, University Library of Munich, Germany.
- Vito Fragnelli & Gianfranco Gambarelli, 2014. "Further open problems in cooperative games," Operations Research and Decisions, Wroclaw University of Technology, Institute of Organization and Management, vol. 4, pages 51-62.
- 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.
- 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.
More about this item
KeywordsKnaster’s procedure; misrepresentation; collusion;
- C70 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - General
StatisticsAccess and download statistics
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.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Lenka Stastna). General contact details of provider: http://edirc.repec.org/data/icunicz.html .
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 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.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.