We develop an auction system that determines a fair number of komi for holding black stones in a GO game between two players of equal strength, and hence the right to the first move. It is modeled as a priority right pricing problem that demands for budget-balanced and egalitarian conditions, where a negative utility is associated with the losers. We establish results involved with the incentive compatible properties for this problem under both deterministic and randomized protocols. © 2009 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Deng, X., & Qi, Q. (2009). Priority right auction for komi setting (Extended Abstract). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5929 LNCS, pp. 521–528). https://doi.org/10.1007/978-3-642-10841-9_51
Mendeley helps you to discover research relevant for your work.