Abstract
The selection problem of m highest ranked out of n candidates is considered for a model while the relative ranking of two candidates is obtained through their pairwise comparison. Deviating from the standard model, it is assumed in this article that the outcome of a pairwise comparison may be manipulated by the two participants. The higher ranked party may intentionally lose to the lower ranked party in order to gain group benefit. We discuss incentive compatible mechanism design issues for such scenarios and develop both possibility and impossibility results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chang, P., Mendonca, D., Yao, X., Raghavachari, M.: An evaluation of ranking methods for multiple incomplete round-robin tournaments. In: Decision Sciences Institute conference 2004 (2004)
Chartrand, G., Lesniak, L.: Graphs and Digraphs. Chapman and Hall, London
Chen, X., Deng, X., Liu, B.J.: On Incentive Compatible Competitive Selection Protocol, full version, available at: http://www.cs.cityu.edu.hk/~deng/
Harary, F., Moser, L.: The theory of round robin tournaments. The American Mathematical Monthly 73(3), 231–246 (1966)
Jech, T.: The ranking of incomplete tournaments: A mathematician’s guide to popular sports. The American Mathematical Monthly 90(4), 246–266 (1983)
Mendonca, D., Raghavachari, M.: Comparing the efficacy of ranking methods for multiple round-robin tournaments. European Journal of Operational Research 123(2000), 593–605 (1999)
Rubinstein, A.: Ranking the participants in a tournament. SIAM Journal of Applied Mathematics 38(1), 108–111 (1980)
Steinhaus, H.: Mathematical Snapshots. Oxford University Press, New York (1950)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, X., Deng, X., Liu, B.J. (2006). On Incentive Compatible Competitive Selection Protocol. In: Chen, D.Z., Lee, D.T. (eds) Computing and Combinatorics. COCOON 2006. Lecture Notes in Computer Science, vol 4112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11809678_4
Download citation
DOI: https://doi.org/10.1007/11809678_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36925-7
Online ISBN: 978-3-540-36926-4
eBook Packages: Computer ScienceComputer Science (R0)