Incentive Compatible Selection

  • Living reference work entry
  • Latest version View entry history
  • First Online:
Encyclopedia of Algorithms
  • 200 Accesses

Years and Authors of Summarized Original Work

2006; Chen, Deng, Liu

Problem Definition

Ensuring truthful evaluation of alternatives in human activities has always been an important issue throughout history. In sports, in particular, such an issue is vital and practice of the fair-play principle has been consistently put forward as a matter of foremost priority. In addition to relying on the code of ethics and professional responsibility of players and coaches, the design of game rules is an important measure in enforcing fair play.

Ranking alternatives through pairwise comparisons (or competitions) is the most common approach in sports tournaments. Its goal is to find out the “true” ordering among alternatives through complete or partial pairwise competitions [1, 37]. Such studies have been mainly based on the assumption that all the players play truthfully, i.e., with their maximal effort. It is, however, possible that some players form a coalition and cheat for group benefit. An...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Recommended Reading

  1. Chang P, Mendonca D, Yao X, Raghavachari M (2004) An evaluation of ranking methods for multiple incomplete round-robin tournaments. In: Proceedings of the 35th annual meeting of decision sciences institute, Boston, 20–23 Nov 2004

    Google Scholar 

  2. Chen X, Deng X, Liu BJ (2006) On incentive compatible competitive selection protocol. In: Proceedings of the 12th annual international computing and combinatorics conference (COCOON’06), Taipei, 15–18 Aug 2006, pp 13–22

    Google Scholar 

  3. Harary F, Moser L (1966) The theory of round robin tournaments. Am Math Mon 73(3):231–246

    Article  MATH  MathSciNet  Google Scholar 

  4. Jech T (1983) The ranking of incomplete tournaments: a mathematician’s guide to popular sports. Am Math Mon 90(4):246–266

    Article  MATH  MathSciNet  Google Scholar 

  5. Mendonca D, Raghavachari M (1999) Comparing the efficacy of ranking methods for multiple round-robin tournaments. Eur J Oper Res 123:593–605

    Article  Google Scholar 

  6. Rubinstein A (1980) Ranking the participants in a tournament. SIAM J Appl Math 38(1):108–111

    Article  MATH  MathSciNet  Google Scholar 

  7. Steinhaus H (1950) Mathematical snapshots. Oxford University Press, New York

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to ** Chen .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer Science+Business Media New York

About this entry

Cite this entry

Chen, X. (2015). Incentive Compatible Selection. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27848-8_185-3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-27848-8_185-3

  • Received:

  • Accepted:

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Online ISBN: 978-3-642-27848-8

  • eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Chapter history

  1. Latest

    Incentive Compatible Selection
    Published:
    30 May 2015

    DOI: https://doi.org/10.1007/978-3-642-27848-8_185-3

  2. Original

    Incentive Compatible Selection
    Published:
    25 November 2014

    DOI: https://doi.org/10.1007/978-3-642-27848-8_185-2

Navigation