On incentive compatible competitive selection protocol

Xi Chen; Xiaotie Deng; Becky Jie Liu

doi:10.1007/11809678_4

On incentive compatible competitive selection protocol

Xi Chen
, Xiaotie Deng
, Becky Jie Liu

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

7 Citations (Scopus)

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. © Springer-Verlag Berlin Heidelberg 2006.

Original language	English
Title of host publication	Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings
Publisher	Springer Verlag
Pages	13-22
Volume	4112 LNCS
ISBN (Print)	3540369252, 9783540369257
DOIs	https://doi.org/10.1007/11809678_4
Publication status	Published - 2006
Event	12th Annual International Conference on Computing and Combinatorics, COCOON 2006 - Taipei, Taiwan, China Duration: 15 Aug 2006 → 18 Aug 2006

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4112 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th Annual International Conference on Computing and Combinatorics, COCOON 2006
Place	Taiwan, China
City	Taipei
Period	15/08/06 → 18/08/06

Bibliographical note

Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

Funding

Research supported by a CERG grant (CityU 1156/04E) of Research Grants Council of Hong Kong SAR, PR China.

RGC Funding Information

RGC-funded

Access Output

10.1007/11809678_4

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

Chen, X., Deng, X., & Liu, B. J. (2006). On incentive compatible competitive selection protocol. In Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings (Vol. 4112 LNCS, pp. 13-22). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4112 LNCS). Springer Verlag. https://doi.org/10.1007/11809678_4

Chen, Xi ; Deng, Xiaotie ; Liu, Becky Jie. / On incentive compatible competitive selection protocol. Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Vol. 4112 LNCS Springer Verlag, 2006. pp. 13-22 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{be5961f2a4e647b287a2023e7e994db6,

title = "On incentive compatible competitive selection protocol",

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. {\textcopyright} Springer-Verlag Berlin Heidelberg 2006.",

author = "Xi Chen and Xiaotie Deng and Liu, \{Becky Jie\}",

note = "Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].; 12th Annual International Conference on Computing and Combinatorics, COCOON 2006 ; Conference date: 15-08-2006 Through 18-08-2006",

year = "2006",

doi = "10.1007/11809678\_4",

language = "English",

isbn = "3540369252",

volume = "4112 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "13--22",

booktitle = "Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings",

address = "Germany",

}

Chen, X, Deng, X & Liu, BJ 2006, On incentive compatible competitive selection protocol. in Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. vol. 4112 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4112 LNCS, Springer Verlag, pp. 13-22, 12th Annual International Conference on Computing and Combinatorics, COCOON 2006, Taipei, Taiwan, China, 15/08/06. https://doi.org/10.1007/11809678_4

On incentive compatible competitive selection protocol. / Chen, Xi; Deng, Xiaotie; Liu, Becky Jie.
Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Vol. 4112 LNCS Springer Verlag, 2006. p. 13-22 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4112 LNCS).

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - On incentive compatible competitive selection protocol

AU - Chen, Xi

AU - Deng, Xiaotie

AU - Liu, Becky Jie

N1 - Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].

PY - 2006

Y1 - 2006

N2 - 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. © Springer-Verlag Berlin Heidelberg 2006.

AB - 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. © Springer-Verlag Berlin Heidelberg 2006.

UR - https://www.scopus.com/pages/publications/33749539691

UR - https://www.scopus.com/pages/publications/33749539691#tab=impact

U2 - 10.1007/11809678_4

DO - 10.1007/11809678_4

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 3540369252

SN - 9783540369257

VL - 4112 LNCS

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

SP - 13

EP - 22

BT - Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings

PB - Springer Verlag

T2 - 12th Annual International Conference on Computing and Combinatorics, COCOON 2006

Y2 - 15 August 2006 through 18 August 2006

ER -

Chen X, Deng X, Liu BJ. On incentive compatible competitive selection protocol. In Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings. Vol. 4112 LNCS. Springer Verlag. 2006. p. 13-22. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11809678_4

On incentive compatible competitive selection protocol

Abstract

Publication series

Conference

Bibliographical note

Funding

RGC Funding Information

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this