Complexity of combinatorial market makers

We analyze the computational complexity of market maker pricing algorithms for combinatorial prediction markets. We focus on Hanson's popular logarithmic market scoring rule market maker (LMSR). Our goal is to implicitly maintain correct LMSR prices across an exponentially large outcome space. We examine both permutation combinatorics, where outcomes are permutations of objects, and Boolean combinatorics, where outcomes are combinations of binary events. We look at three restrictive languages that limit what traders can bet on. Even with severely limited languages, we find that LMSR pricing is #P-hard, even when the same language admits polynomial-time matching without the market maker. We then propose an approximation technique for pricing permutation markets based on an algorithm for online permutation learning. The connections we draw between LMSR pricing and the literature on online learning with expert advice may be of independent interest.

[1]  Manfred K. Warmuth,et al.  The Weighted Majority Algorithm , 1994, Inf. Comput..

[2]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[3]  H. Balakrishnan,et al.  Polynomial approximation algorithms for belief matrix maintenance in identity management , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[4]  L. Khachiyan,et al.  ON THE COMPLEXITY OF NONNEGATIVE-MATRIX SCALING , 1996 .

[5]  Peter Winkler,et al.  Counting linear extensions is #P-complete , 1991, STOC '91.

[6]  David M. Pennock,et al.  Pricing combinatorial markets for tournaments , 2008, STOC.

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

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

[9]  Lance Fortnow,et al.  Betting on permutations , 2007, EC '07.

[10]  Yoav Freund,et al.  A decision-theoretic generalization of on-line learning and an application to boosting , 1995, EuroCOLT.

[11]  Manfred K. Warmuth,et al.  Learning Permutations with Exponential Weights , 2007, COLT.

[12]  Robert Forsythe,et al.  Anatomy of an Experimental Political Stock Market , 1992 .

[13]  Lance Fortnow,et al.  Bluffing and Strategic Reticence in Prediction Markets , 2007, WINE.

[14]  Seinosuke Toda,et al.  PP is as Hard as the Polynomial-Time Hierarchy , 1991, SIAM J. Comput..

[15]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[16]  R. Thaler,et al.  Anomalies Parimutuel Betting Markets: Racetracks and Lotteries , 1988 .

[17]  R. Hanson,et al.  An experimental test of combinatorial information markets , 2009 .

[18]  Vladimir Vovk,et al.  A game of prediction with expert advice , 1995, COLT '95.

[19]  Lance Fortnow,et al.  Combinatorial betting , 2007, SECO.

[20]  Thomas A. Rietz,et al.  Wishes, expectations and actions: a survey on price formation in election stock markets , 1999 .

[21]  Richard Sinkhorn.  A Relationship Between Arbitrary Positive Matrices and Doubly Stochastic Matrices , 1964 .

[22]  Michael P. Wellman,et al.  Betting boolean-style: a framework for trading in securities based on logical formulas , 2003, EC '03.

[23]  David A. Bessler,et al.  Subjective Probabilities and Scoring Rules: Experimental Evidence , 1989 .

[24]  Alex Samorodnitsky,et al.  A Deterministic Strongly Polynomial Algorithm for Matrix Scaling and Approximate Permanents , 1998, STOC '98.

[25]  Kenneth Oliven,et al.  Suckers Are Born but Markets Are Made: Individual Rationality, Arbitrage, and Market Efficiency on an Electronic Futures Market , 2004, Manag. Sci..

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