Advertisement

On Incentive Compatible Competitive Selection Protocol

  • Xi Chen
  • Xiaotie Deng
  • Becky Jie Liu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4112)

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.

Keywords

Indexing Function Ranking Function Ranking Method Full Version Ideal Protocol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)Google Scholar
  2. 2.
    Chartrand, G., Lesniak, L.: Graphs and Digraphs. Chapman and Hall, LondonGoogle Scholar
  3. 3.
    Chen, X., Deng, X., Liu, B.J.: On Incentive Compatible Competitive Selection Protocol, full version, available at: http://www.cs.cityu.edu.hk/~deng/
  4. 4.
    Harary, F., Moser, L.: The theory of round robin tournaments. The American Mathematical Monthly 73(3), 231–246 (1966)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Jech, T.: The ranking of incomplete tournaments: A mathematician’s guide to popular sports. The American Mathematical Monthly 90(4), 246–266 (1983)MATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    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)Google Scholar
  7. 7.
    Rubinstein, A.: Ranking the participants in a tournament. SIAM Journal of Applied Mathematics 38(1), 108–111 (1980)MATHCrossRefGoogle Scholar
  8. 8.
    Steinhaus, H.: Mathematical Snapshots. Oxford University Press, New York (1950)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Xi Chen
    • 1
  • Xiaotie Deng
    • 2
  • Becky Jie Liu
    • 2
  1. 1.Department of Computer ScienceTsinghua University 
  2. 2.Department of Computer ScienceCity University of Hong Kong 

Personalised recommendations