On incentive compatible competitive selection protocol

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4112 LNCS, Issue , 2006, Pages 13-22

  Chen, Xi ^a   Deng, Xiaotie ^b   Liu, Becky Jie ^b  

^a TSINGHUA UNIVERSITY   (China)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; LOGIC DESIGN; MATHEMATICAL MODELS; PROBLEM SOLVING;

COMPATIBLE COMPETITIVE SELECTION PROTOCOL; INCENTIVE COMPATIBLE MECHANISM; PAIRWISE COMPARISON;

NETWORK PROTOCOLS;

EID: 33749539691     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11809678_4     Document Type: Conference Paper

References (8)

1. P. Chang, D. Mendonca, X. Yao, and M. Raghavachari. An evaluation of ranking methods for multiple incomplete round-robin tournaments. In Decision Sciences Institute conference 2004.
2. G. Chartrand and L. Lesniak. Graphs and Digraphs. Chapman and Hall, London.
3. X. Chen, X. Deng, and B.J. Liu. On Incentive Compatible Competitive Selection Protocol, full version, available at http://www.cs.cityu.edu.hk/~deng/ .
4. F. Harary and L.Moser. The theory of round robin tournaments. The American Mathematical Monthly, 73(3):231-246, Mar. 1966.
5. T. Jech. The ranking of incomplete tournaments: A mathematician's guide to popular sports. The American Mathematical Monthly, 90(4):246-266. Apr. 1983.
6. D. Mendonca and M. Raghavachari. Comparing the efficacy of ranking methods for multiple round-robin tournaments. European Journal of Operational Research, 123(2000):593-605, Jan. 1999.
7. A. Rubinstein. Ranking the participants in a tournament. SIAM Journal of Applied Mathematics, 38(1):108-111, 1980.
8. H. Steinhaus. Mathematical Snapshots. Oxford University Press, New York, 1950.