A new understanding of prediction markets via no-regret learning

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2010, Pages 189-198

  Chen, Yiling ^a   Vaughan, Jennifer Wortman ^a  

^a HARVARD UNIVERSITY   (United States)

Author keywords

follow the regularized leader; market scoring rules; online learning; prediction markets; prediction with expert advice

Indexed keywords

CONVEX COST FUNCTION; EXPERT ADVICE; LEARNING PROBLEM; LEARNING SETTINGS; LOGARITHMIC MARKET SCORING RULE; MARKET-MAKER; ONLINE LEARNING; PREDICTION MARKETS; PREDICTION WITH EXPERT ADVICE; REGULARIZER; SCORING RULES;

COST FUNCTIONS; COSTS; E-LEARNING; ELECTRONIC COMMERCE; FORECASTING;

LEARNING ALGORITHMS;

EID: 77954750020     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1807342.1807372     Document Type: Conference Paper

References (35)

1. S. Agrawal, E. Delage, M. Peters, Z.Wang, and Y. Ye. A unified framework for dynamic pari-mutuel information market design. In ACM EC, 2009.
2. G. Brier. Verification of forecasts expressed in terms of probability. Monthly Weather Review, 78(1):1-3, 1950.
3. A. Buja, W. Stuetzle, and Y. Shen. Loss functions for binary class probability estimation and classification: Structure and applications. Working draft, November 2005.
4. N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussler, R. Schapire, and M. Warmuth. How to use expert advice. Journal of the ACM, 44(3):427-485, 1997.
5. Y. Chen and D. M. Pennock. A utility framework for bounded-loss market makers. In UAI, 2007.
6. Y. Chen, L. Fortnow, N. Lambert, D. M. Pennock, and J. Wortman. Complexity of combinatorial market makers. In ACM EC, 2008.
7. Y. Chen, S. Goel, and D. M. Pennock. Pricing combinatorial markets for tournaments. In ACM STOC, 2008.
8. H. Föllmer and A. Schied. Convex measures of risk and trading constraints. Finance and Stochastics, 6(4), 2002.
9. Y. Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Comp. and System Sciences, 55(1):119-139, 1997.
10. X. Gao, Y. Chen, and D. M. Pennock. Betting on the real line. In WINE, 2009.
11. P. H. Garthwaite, J. B. Kadane, and A. O'Hagan. Statistical methods for eliciting probability distributions. Journal of the American Statistical Association, 100:680-701, 2005.
12. T. Gneiting and A. Raftery. Strictly proper scoring rules, prediction, and estimation. Journal of the American Statistical Association, 102(477):359-378, 2007.
13. I. J. Good. Rational decisions. Journal of the Royal Statistical Society, Series B (Methodological), 14(1):107-114, 1952.
14. J. Hannan. Approximation to Bayes risk in repeated play. In M. Dresher, A. W. Tucker, and P. Wolfe, editors, Contributions to the Theory of Games, Volume III, pages 97-139. Princeton University Press, Princeton, 1957.
15. R. Hanson. Combinatorial information market design. Information Systems Frontiers, 5(1):105-119, 2003.
16. R. Hanson. Logarithmic market scoring rules for modular combinatorial information aggregation. Journal of Prediction Markets, 1(1):3-15, 2007.
17. E. Hazan. A survey: The convex optimization approach to regret minimization. Working draft, September 2009.
18. E. Hazan and S. Kale. Extracting certainty from uncertainty: Regret bounded by variation in costs. In COLT, 2008.
19. E. Hazan, A. Agarwal, and S. Kale. Logarithmic regret algorithms for online convex optimization. Machine Learning, 69(2-3):169-192, 2007. (Pubitemid 47574314)
20. D. Helmbold and M. Warmuth. Learning permutations with exponential weights. JMLR, 10:1705-1736, 2009.
21. M. Hutter and J. Poland. Adaptive online prediction by following the perturbed leader. JMLR, 6:639-660, 2005.
22. A. T. Kalai and S. Vempala. Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 71(3):291-307, 2005.
23. T. Kim. Differentiability of the value function: A new characterization. Seoul Journal of Economics, 6(3), 1993.
24. J. Kivinen and M. Warmuth. Exponentiated gradient versus gradient descent for linear predictors. Journal of Information and Computation, 132(1):1-63, 1997.
25. J. Kivinen and M. Warmuth. Averaging expert predictions. In EuroCOLT, 1999.
26. N. Lambert, D. M. Pennock, and Y. Shoham. Eliciting properties of probability distributions. In ACM EC, 2008.
27. J. Ledyard, R. Hanson, and T. Ishikida. An experimental test of combinatorial information markets. Journal of Economic Behavior and Organization, 69:182-189, 2009.
28. N. Littlestone and M. Warmuth. The weighted majority algorithm. Info. and Computation, 108(2):212-261, 1994.
29. P. Milgrom and I. Segal. Envelope theorems for arbitrary choice sets. Econometrica, 70(2):583-601, 2002.
30. D. M. Pennock. A dynamic pari-mutuel market for hedging, wagering, and information aggregation. In ACM EC, 2004.
31. D. M. Pennock and R. Sami. Computational aspects of prediction markets. In N. Nisan, T. Roughgarden, É. Tardos, and V. Vazirani, editors, Algorithmic Game Theory. Cambridge University Press, 2007.
32. M. D. Reid and R. C. Williamson. Surrogate regret bounds for proper losses. In ICML, 2009.
33. L. J. Savage. Elicitation of personal probabilities and expectations. Journal of the American Statistical Association, 66 (336):783-801, 1971.
34. S. Shalev-Shwartz and Y. Singer. A primal-dual perspective of online learning algorithms. Machine Learning, 69(2-3): 115-142, 2007. (Pubitemid 47574312)
35. M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In ICML, 2003.