Abstract
We focus on a permutation betting market under parimutuel call auction model where traders bet on final rankings of n candidates. We present a Proportional Betting mechanism for this market. Our mechanism allows traders to bet on any subset of the n 2 ‘candidate-rank’ pairs, and rewards them proportionally to the number of pairs that appear in the final outcome. We show that market organizer’s decision problem for this mechanism can be formulated as a convex program of polynomial size. Further, the formulation yields a set of n 2 unique marginal prices that are sufficient to price the bets in this mechanism, and are computable in polynomial-time. These marginal prices reflect the traders’ beliefs about the marginal distributions over outcomes. More importantly, we propose techniques to compute the joint distribution over n! permutations from these marginal distributions. We show that using a maximum entropy criterion, we can obtain a concise parametric form (with only n 2 parameters) for the joint distribution which is defined over an exponentially large state space. We then present an approximation algorithm for computing the parameters of this distribution. In fact, our algorithm addresses a generic problem of finding the maximum entropy distribution over permutations that has a given mean, and is of independent interest.
Research supported in part by NSF DMS-0604513 and Boeing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Chen, Y., Fortnow, L., Nikolova, E., Pennock, D.M.: Combinatorial betting. SIGecom Exch. 7(1), 61–64 (2007)
Hanson, R.: Combinatorial information market design. Information Systems Frontiers 5(1), 107–119 (2003)
Hanson, R.D.: Logarithmic market scoring rules for modular combinatorial information aggregation. Journal of Prediction Markets (2007)
Pennock, D.M.: A dynamic pari-mutuel market for hedging, wagering, and information aggregation. In: ACM conference on Electronic commerce (2004)
Lange, J., Economides, N.: A parimutuel market microstructure for contingent claims. European Financial Management 11(1) (2005)
Peters, M., So, A.M.C., Ye, Y.: A convex parimutuel formulation for contingent claim markets. Working Paper (2005), http://www.stanford.edu/~yyye/cpcam-ec.pdf
Peters, M., So, A.M.C., Ye, Y.: Pari-mutuel markets: Mechanisms and performance. In: Workshop on Internet and Network Economics (2007)
Chen, Y., Fortnow, L., Lambert, N., Pennock, D.M., Wortman, J.: Complexity of combinatorial market makers. CoRR abs/0802.1362 (2008)
Chen, Y., Goel, S., Pennock, D.M.: Pricing combinatorial markets for tournaments. In: ACM Symposium on Theory of Computing (2008)
Fortnow, L., Kilian, J., Pennock, D.M., Wellman, M.P.: Betting boolean-style: a framework for trading in securities based on logical formulas. In: ACM conference on Electronic commerce (2003)
Chen, Y., Fortnow, L., Nikolova, E., Pennock, D.M.: Betting on permutations. ACM conference on Electronic commerce (2007)
Grötschel, M., Lovász, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)
Agrawal, S., Wang, Z., Ye, Y.: Parimutuel betting on permutations. Technical report (2008), http://arxiv.org/abs/0804.2288
Manski, C.: Interpreting the predictions of prediction markets. Economic Letters 91(3) (2006)
Ottaviani, M., Sørensen, P.N.: Aggregation of information and beliefs in prediction markets. Mimeo, London Business School (2006)
Wolfers, J., Zitzewitz, E.: Interpreting prediction market prices as probabilities. Working Paper 12200, National Bureau of Economic Research (May 2006), http://www.nber.org/papers/w12200
Birkhoff, G.: Three observations on linear algebra. Univ. Nac. Tucuman Rev. A 5 (1946)
Dulmage, L., Halperin, I.: On a theorem of Frobenius-König and J. von Neumann’s game of hide and seek. Trans. Roy. Soc. Canada Sect. III 49 (1955)
Valiant, L.: The complexity of computing the permanent. Theoretical Computer Science (1979)
Jerrum, M., Sinclair, A., Vigoda, E.: A polynomial-time approximation algorithm for the permanent of a matrix with non-negative entries. In: ACM symposium on Theory of computing (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agrawal, S., Wang, Z., Ye, Y. (2008). Parimutuel Betting on Permutations. In: Papadimitriou, C., Zhang, S. (eds) Internet and Network Economics. WINE 2008. Lecture Notes in Computer Science, vol 5385. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92185-1_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-92185-1_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-92184-4
Online ISBN: 978-3-540-92185-1
eBook Packages: Computer ScienceComputer Science (R0)