Skip to main content

Priority Right Auction for Komi Setting

(Extended Abstract)

  • Conference paper
Internet and Network Economics (WINE 2009)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 5929))

Included in the following conference series:

Abstract

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. http://senseis.xmp.net/?KomiBidding

  2. Archer, A., Tardös, Ë.: Truthful Mechanisms for One-Parameter Agents. In: Proceedings of 42nd Annual Symposium on Foundations of Computer Science, Las Vegas, Nevada, USA, pp. 482–491 (2001)

    Google Scholar 

  3. Goldberg, A., Hartline, J., Karlin, A., Saks, M., Wright, A.: Competitive Auctions. Games and Economic Behavior 55(2), 242–269 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Jackson, M.O.: A Crash Course in Implementation Theory. Social Choice and Welfare 18, 655–708 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  5. Jehiel, P., Moldovanu, B.: Strategic Non-participation. Rand Journal of Economics 27, 84–98 (1996)

    Article  Google Scholar 

  6. Maskin, E., Sjostrom, T.: Implementation theory. In: Arrow, K.J., Sen, A.K., Suzumura, K. (eds.) Handbook of Social Choice and Welfare, 1st edn., vol. 1, ch. 5. Elsevier, Amsterdam (2002)

    Google Scholar 

  7. Morgan, J.: Dissolving a partnership (un)fairly. Economic Theory 23, 909–923 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  8. Myerson, R.B.: Optimal Auction Design. Mathematics of Operations Research 6(1), 58–73 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  9. Nisan, N., Ronen, A.: Algorithmic Mechanism Design (Extended Abstract). In: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, Atlanta, Georgia, USA, pp. 129–140. ACM, New York (1999)

    Chapter  Google Scholar 

  10. Parkes, D.C.: Computational Mechanism Design. In: Lecture notes of Tutorials at 10th Conf. on Theoretical Aspectsof Rationality and Knowledge (TARK 2005), Institute of Mathematical Sciences, University of Singapore (2008) (to appear)

    Google Scholar 

  11. Pazner, E., Schmeidler, D.: Egalitarian-equivalent allocations: a new concept of economic equity. Q. J. Econ. 92, 671–687 (1978)

    Article  Google Scholar 

  12. Vickrey, W.: Counter speculation, auctions, and competitive sealed tenders. Journal of Finance 16, 8–37 (1961)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Deng, X., Qi, Q. (2009). Priority Right Auction for Komi Setting. In: Leonardi, S. (eds) Internet and Network Economics. WINE 2009. Lecture Notes in Computer Science, vol 5929. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10841-9_51

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-10841-9_51

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-10840-2

  • Online ISBN: 978-3-642-10841-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics