An Axiomatic Characterization of Continuous-Outcome Market Makers

  • Xi Alice Gao
  • Yiling Chen
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6484)

Abstract

Most existing market maker mechanisms for prediction markets are designed for events with a finite number of outcomes. All known attempts on designing market makers for forecasting continuous-outcome events resulted in mechanisms with undesirable properties. In this paper, we take an axiomatic approach to study whether it is possible for continuous-outcome market makers to satisfy certain desirable properties simultaneously. We define a general class of continuous-outcome market makers, which allows traders to express their information on any continuous subspace of their choice. We characterize desirable properties of these market makers using formal axioms. Our main result is an impossibility theorem showing that if a market maker offers binary-payoff contracts, either the market maker has unbounded worst case loss or the contract prices will stop being responsive, making future trades no longer profitable. In addition, we analyze a mechanism that does not belong to our framework. This mechanism has a worst case loss linear in the number of submitted orders, but encourages some undesirable strategic behavior.

Keywords

Prediction markets continuous-outcome events combinatorial prediction markets expressive betting 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Berg, J.E., Forsythe, R., Nelson, F.D., Rietz, T.A.: Results from a dozen years of election futures markets research. In: Plott, C.A., Smith, V. (eds.) Handbook of Experimental Economic Results (2001)Google Scholar
  2. 2.
    Wolfers, J., Zitzewitz, E.: Prediction markets. Journal of Economic Perspective 18(2), 107–126 (2004)CrossRefGoogle Scholar
  3. 3.
    Forsythe, R., Nelson, F., Neumann, G.R., Wright, J.: Anatomy of an experimental political stock market. American Economic Review 82(5), 1142–1161 (1992)Google Scholar
  4. 4.
    Forsythe, R., Rietz, T.A., Ross, T.W.: Wishes, expectations and actions: a survey on price formation in election stock markets. Journal of Economic Behavior & Organization 39(1), 83–110 (1999)CrossRefGoogle Scholar
  5. 5.
    Debnath, S., Pennock, D.M., Giles, C.L., Lawrence, S.: Information incorporation in online in-game sports betting markets. In: EC 2003: Proceedings of the 4th ACM Conference on Electronic Commerce, pp. 258–259. ACM, New York (2003)CrossRefGoogle Scholar
  6. 6.
    Chen, K.Y., Plott, C.R.: Information aggregation mechanisms: Concept, design and implementation for a sales forecasting problem. Working Paper No.1131, California Institute of Technology (2002)Google Scholar
  7. 7.
    Hanson, R.D.: Combinatorial information market design. Information Systems Frontiers 5(1), 107–119 (2003)CrossRefGoogle Scholar
  8. 8.
    Hanson, R.D.: Logarithmic market scoring rules for modular combinatorial information aggregation. Journal of Prediction Markets 1(1), 1–15 (2007)Google Scholar
  9. 9.
    Pennock, D.M.: A dynamic pari-mutuel market for hedging, wagering, and information aggregation. In: EC 2004: Proceedings of the 5th ACM Conference on Electronic Commerce, pp. 170–179. ACM, New York (2004)CrossRefGoogle Scholar
  10. 10.
    Chen, Y., Pennock, D.M.: A utility framework for bounded-loss market makers. In: UAI 2007: Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, pp. 49–56 (2007)Google Scholar
  11. 11.
    Peters, M., So, A.M.C., Ye, Y.: Pari-mutuel markets: Mechanisms and performance. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 82–95. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  12. 12.
    Agrawal, S., Delage, E., Peters, M., Wang, Z., Ye, Y.: A unified framework for dynamic pari-mutuel information market design. In: EC 2009: Proceedings of the Tenth ACM Conference on Electronic Commerce, pp. 255–264. ACM, New York (2009)Google Scholar
  13. 13.
    Chen, Y., Pennock, D.M., Kasturi, T.: An empirical study of dynamic pari-mutuel markets: Evidence from the Tech Buzz Game. In: The Workshop on Web Mining and Web Usage Analysis, WebKDD. LNCS, Springer, Heidelberg (2008)Google Scholar
  14. 14.
    Goel, S., Pennock, D., Reeves, D.M., Yu, C.: Yoopick: A combinatorial sports prediction market. In: AAAI, pp. 1880–1881 (2008)Google Scholar
  15. 15.
    Othman, A., Sandholm, T.: Automated market-making in the large: the gates hillman prediction market. In: EC 2010: Proceedings of the 11th ACM Conference on Electronic Commerce, pp. 367–376. ACM, New York (2010)CrossRefGoogle Scholar
  16. 16.
    Gao, X., Chen, Y., Pennock, D.M.: Betting on the real line. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 553–560. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  17. 17.
    Chen, Y., Vaughan, J.W.: A new understanding of prediction markets via no-regret learning. In: EC 2010: Proceedings of the 11th ACM Conference on Electronic Commerce, pp. 189–198. ACM, New York (2010)CrossRefGoogle Scholar
  18. 18.
    Chen, Y., Fortnow, L., Lambert, N., Pennock, D.M., Wortman, J.: Complexity of combinatorial market makers. In: EC 2008: Proceedings of the 9th ACM Conference on Electronic Commerce, pp. 190–199. ACM, New York (2008)CrossRefGoogle Scholar
  19. 19.
    Chen, Y., Goel, S., Pennock, D.M.: Pricing combinatorial markets for tournaments. In: STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 305–314. ACM, New York (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Xi Alice Gao
    • 1
  • Yiling Chen
    • 1
  1. 1.School or Engineering and Applied SciencesHarvard UniversityCambridge

Personalised recommendations