All Men Count with You, but None Too Much: Information Aggregation and Learning in Prediction Markets

all men count with you, but none too much: Information Aggregation and Learning in Prediction Markets by Sindhu Kutty Chair: Jacob D. Abernethy Prediction markets are markets that are set up to aggregate information from a population of traders in order to predict the outcome of an event. In this thesis, we consider the problem of designing prediction markets with discernible semantics of aggregation whose syntax is amenable to analysis. For this, we will use tools from computer science (in particular, machine learning), statistics and economics. First, we construct generalized log scoring rules for outcomes drawn from high-dimensional spaces. Next, based on this class of scoring rules, we design the class of exponential family prediction markets. We show that this market mechanism performs an aggregation of private beliefs of traders under various agent models. Finally, we present preliminary results extending this work to understand the dynamics of related markets using probabilistic graphical model techniques. We also consider the problem in reverse: using prediction markets to design machine learning algorithms. In particular, we use the idea of sequential aggregation from prediction markets to design machine learning algorithms that are suited to situations where data arrives sequentially. We focus on the design of algorithms for

[1]  Inderjit S. Dhillon,et al.  Clustering with Bregman Divergences , 2005, J. Mach. Learn. Res..

[2]  Akimichi Takemura,et al.  Defensive Forecasting for Linear Protocols , 2005, ALT.

[3]  Yoav Shoham,et al.  Eliciting properties of probability distributions , 2008, EC '08.

[4]  David M. Pennock,et al.  Prediction Markets : Equilibrium Strategies with a Market Maker ? , 2009 .

[5]  Jennifer Wortman Vaughan,et al.  Cost function market makers for measurable spaces , 2013, EC '13.

[6]  Inderjit S. Dhillon,et al.  Clustering on the Unit Hypersphere using von Mises-Fisher Distributions , 2005, J. Mach. Learn. Res..

[7]  Manfred K. Warmuth,et al.  Relative Loss Bounds for On-Line Density Estimation with the Exponential Family of Distributions , 1999, Machine Learning.

[8]  M. Ostrovsky Information Aggregation in Dynamic Markets With Strategic Traders , 2012 .

[9]  Philip M. Long,et al.  Apple tasting and nearly one-sided learning , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[10]  Michael P. Wellman,et al.  Aggregating probabilistic beliefs: Market mechanisms and graphical representations , 1999 .

[11]  Kathryn B. Laskey,et al.  Learning Parameters by Prediction Markets and Kelly Rule for Graphical Models , 2013, UAI Application Workshops.

[12]  Nathan Lay,et al.  Supervised Aggregation of Classifiers using Artificial Prediction Markets , 2010, ICML.

[13]  Paul Resnick,et al.  The influence limiter: provably manipulation-resistant recommender systems , 2007, RecSys '07.

[14]  Nelson Fabian Real power! , 2011, Journal of environmental health.

[15]  Paola Sebastiani,et al.  Coherent dispersion criteria for optimal experimental design , 1999 .

[16]  Robin Hanson,et al.  Combinatorial Information Market Design , 2003, Inf. Syst. Frontiers.

[17]  J. Sherman,et al.  Adjustment of an Inverse Matrix Corresponding to a Change in One Element of a Given Matrix , 1950 .

[18]  Stanko Dimitrov,et al.  Non-myopic strategies in prediction markets , 2008, EC '08.

[19]  T. Bell,et al.  Private Prediction Markets and the Law , 2012 .

[20]  Philip M. Long,et al.  On-line learning of linear functions , 1991, STOC '91.

[21]  G. Brier VERIFICATION OF FORECASTS EXPRESSED IN TERMS OF PROBABILITY , 1950 .

[22]  Amos J. Storkey,et al.  Multi-period Trading Prediction Markets with Connections to Machine Learning , 2014, ICML.

[23]  Mark D. Reid,et al.  Risk Dynamics in Trade Networks , 2014, ArXiv.

[24]  D. Rubin,et al.  Statistical Analysis with Missing Data. , 1989 .

[25]  William S. Jewell,et al.  Credible Means are exact Bayesian for Exponential Families , 1974, ASTIN Bulletin.

[26]  Manfred K. Warmuth,et al.  The weighted majority algorithm , 1989, 30th Annual Symposium on Foundations of Computer Science.

[27]  Gábor Lugosi,et al.  Prediction, learning, and games , 2006 .

[28]  Mark D. Reid,et al.  Convex foundations for generalized MaxEnt models , 2014 .

[29]  Lian Jian,et al.  Aggregation and Manipulation in Prediction Markets: Effects of Trading Mechanism and Information Distribution , 2012, Manag. Sci..

[30]  Michael P. Wellman,et al.  Graphical Models for Groups: Belief Aggregation and Risk Sharing , 2005, Decis. Anal..

[31]  Jacob D. Abernethy,et al.  Information aggregation in exponential family markets , 2014, EC.

[32]  J. F. C. Kingman,et al.  Information and Exponential Families in Statistical Theory , 1980 .

[33]  David M. Pennock,et al.  Betting on the Real Line , 2009, WINE.

[34]  R. Hanson LOGARITHMIC MARKETS CORING RULES FOR MODULAR COMBINATORIAL INFORMATION AGGREGATION , 2012 .

[35]  Robert D. Kleinberg,et al.  Regret bounds for sleeping experts and bandits , 2010, Machine Learning.

[36]  Jennifer Wortman Vaughan,et al.  A new understanding of prediction markets via no-regret learning , 2010, EC '10.

[37]  G. Bennett Probability Inequalities for the Sum of Independent Random Variables , 1962 .

[38]  D. Rubin,et al.  Statistical Analysis with Missing Data , 1988 .

[39]  Michael I. Jordan,et al.  Graphical Models, Exponential Families, and Variational Inference , 2008, Found. Trends Mach. Learn..

[40]  Alexander Schied,et al.  Convex measures of risk and trading constraints , 2002, Finance Stochastics.

[41]  J. J. Kelly A new interpretation of information rate , 1956 .

[42]  L. J. Savage Elicitation of Personal Probabilities and Expectations , 1971 .

[43]  R. Roll Orange Juice and Weather , 1984 .

[44]  Michael P. Wellman,et al.  Representing Aggregate Belief through the Competitive Equilibrium of a Securities Market , 1997, UAI.

[45]  Jennifer Wortman Vaughan,et al.  Efficient Market Making via Convex Optimization, and a Connection to Online Learning , 2013, TEAC.

[46]  Y. Mansour,et al.  Algorithmic Game Theory: Learning, Regret Minimization, and Equilibria , 2007 .

[47]  G. Shafer,et al.  Probability and Finance: It's Only a Game! , 2001 .

[48]  P. Diaconis,et al.  Conjugate Priors for Exponential Families , 1979 .

[49]  Jacob D. Abernethy,et al.  A Characterization of Scoring Rules for Linear Properties , 2012, COLT.

[50]  Baruch Awerbuch,et al.  Competitive collaborative learning , 2005, J. Comput. Syst. Sci..

[51]  Kathryn B. Laskey,et al.  Probability and Asset Updating using Bayesian Networks for Combinatorial Prediction Markets , 2012, UAI.

[52]  C. Manski Interpreting the Predictions of Prediction Markets , 2004 .

[53]  Justin Wolfers,et al.  Using Prediction Markets to Track Information Flows: Evidence from Google , 2009, AMMA.

[54]  A. Dawid,et al.  Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory , 2004, math/0410076.

[55]  Varun Kanade,et al.  Sleeping Experts and Bandits with Stochastic Action Availability and Adversarial Rewards , 2009, AISTATS.

[56]  Sindhu Kutty A Prediction Market Approach to Learning with Sequential Advice , 2010 .

[57]  Yishay Mansour,et al.  From External to Internal Regret , 2005, J. Mach. Learn. Res..

[58]  Lance Fortnow,et al.  Multi-outcome and Multidimensional Market Scoring Rules , 2012, ArXiv.

[59]  A. Raftery,et al.  Strictly Proper Scoring Rules, Prediction, and Estimation , 2007 .

[60]  H. Föllmer,et al.  ENTROPIC RISK MEASURES: COHERENCE VS. CONVEXITY, MODEL AMBIGUITY AND ROBUST LARGE DEVIATIONS , 2011 .

[61]  Jennifer Wortman Vaughan,et al.  An optimization-based framework for automated market-making , 2010, EC '11.

[62]  Mark D. Reid,et al.  Interpreting prediction markets: a stochastic approach , 2012, NIPS.

[63]  Ariel D. Procaccia,et al.  Incentive compatible regression learning , 2008, SODA '08.

[64]  Tuomas Sandholm,et al.  Liquidity-Sensitive Automated Market Makers via Homogeneous Risk Measures , 2011, WINE.

[65]  David M. Pennock,et al.  A Utility Framework for Bounded-Loss Market Makers , 2007, UAI.

[66]  Yoram Singer,et al.  Using and combining predictors that specialize , 1997, STOC '97.

[67]  Feng Xiao,et al.  DSybil: Optimal Sybil-Resistance for Recommendation Systems , 2009, 2009 30th IEEE Symposium on Security and Privacy.

[68]  Allan Gut,et al.  An intermediate course in probability , 1995 .

[69]  Amos J. Storkey,et al.  Machine Learning Markets , 2011, AISTATS.

[70]  Vincent Conitzer,et al.  Optimal False-Name-Proof Voting Rules with Costly Voting , 2008, AAAI.

[71]  Santosh S. Vempala,et al.  Efficient algorithms for online decision problems , 2005, Journal of computer and system sciences (Print).

[72]  J McCarthy,et al.  MEASURES OF THE VALUE OF INFORMATION. , 1956, Proceedings of the National Academy of Sciences of the United States of America.

[73]  John L. Kelly,et al.  A new interpretation of information rate , 1956, IRE Trans. Inf. Theory.

[74]  Stanko Dimitrov,et al.  Composition of markets with conflicting incentives , 2010, EC '10.

[75]  Dana Angluin,et al.  Queries and concept learning , 1988, Machine Learning.

[76]  Jacob D. Abernethy,et al.  On risk measures, market making, and exponential families , 2015, SECO.

[77]  David M. Pennock,et al.  Algorithmic Game Theory: Computational Aspects of Prediction Markets , 2007 .

[78]  Terry J. Lyons,et al.  Stochastic finance. an introduction in discrete time , 2004 .