Complexity of combinatorial market makers

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2008, Pages 190-199

  Chen, Yiling ^a   Fortnow, Lance ^b   Lambert, Nicolas ^c   Pennock, David M ^a   Wortman, Jennifer ^d  

^a YAHOO RESEARCH   (United States)

^b NORTHWESTERN UNIVERSITY   (United States)

^c Stanford University   (United States)

^d UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Logarithmic market scoring rule market makers; Online learning with expert advice; Prediction markets

Indexed keywords

EXPERT ADVICE; LOGARITHMIC MARKET SCORING RULE; MARKET-MAKER; ONLINE LEARNING; PREDICTION MARKETS;

APPROXIMATION ALGORITHMS; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COSTS; E-LEARNING; ELECTRIC CONDUCTIVITY MEASUREMENT; ELECTRONIC COMMERCE; FORECASTING; LINGUISTICS; QUERY LANGUAGES;

LEARNING ALGORITHMS;

EID: 58849091675     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1386790.1386822     Document Type: Conference Paper

References (27)

1. H. Balakrishnan, I. Hwang, and C. Tomlin. Polynomial approximation algorithms for belief matrix maintenance in identity management. In 43rd IEEE Conference on Decision and Control, pages 4874-4879, 2004.
2. G. Brightwell and P. Winkler. Counting linear extensions is #P-complete. In ACM Symposium on Theory of Computing, 1991.
3. N. Cesa-Bianchi and G. Lugosi. Prediction, learning, and games. Cambridge University Press, 2006.
4. Y. Chen, L. Fortnow, E. V. Nikolova, and D. M. Pennock. Betting on permutations. In ACM Conference on Electronic Commerce, 2007.
5. Y. Chen, L. Fortnow, E. V. Nikolova, and D. M. Pennock. Combinatorial betting. ACM SIGecom Exchanges, 7(1):865-877, 2007.
6. Y. Chen, S. Goel, and D. M. Pennock. Pricing combinatorial markets for tournaments. In ACM Symposium on Theory of Computing, 2008. To appear.
7. Y. Chen, D. M. Reeves, D. M. Pennock, R. D. Hanson, L. Fortnow, and R. Gonen. Bluffing and strategic reticence in prediction markets. In Workshop on Internet and Network Economics, 2007.
8. Yiling Chen and David M. Pennock. A utility framework for bounded-loss market makers. In Proceedings of the 23rd Conference on Uncertainty in Artificial Intelligence, pages 49-56, 2007.
9. R. Forsythe, F. Nelson, G. Neumann, and J. Wright. Anatomy of an experimental political stock market. The American Economic Review, 82(5):1142-1161, 1992.
10. R. Forsythe, T. Rietz, and T. Ross. Wishes, expectations, and actions: A survey on price formation in election stock markets. Journal of Economic Behavior and Organization, 39:83-110, 1999.
11. L. Fortnow, J. Kilian, D. M. Pennock, and M. Wellman. Betting boolean-style: A framework for trading securities based on logical formulas. Decision Support Systems, 39(1):87-104, 2004.
12. Y. Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997.
13. R. D. Hanson. Combinatorial information market design. Information Systems Frontiers, (1):105-119, 2003.
14. R. D. Hanson. Logarithmic market scoring rules for modular combinatorial information aggregation. Journal of Prediction Markets, 2007.
15. R. D. Hanson, J. Ledyard, and T. Ishikida. An experimental test of combinatorial information markets. Journal of Economic Behavior and Organization, 2008. To appear.
16. D. Helmbold and M. Warmuth. Learning permutations with exponential weights. In 20th Annual Conference on Learning Theory, pages 469-483, 2007.
17. Bahman Kalantari and Leonid Khachiyan. On the complexity of nonnegative-matrix scaling. Linear Algebra and its applications, (240):87-103, 1996.
18. Nathan Linial, Alex Samorodnitsky, and Avi Wigderson. A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents. Combinatorica, 20(4):545-568, 2000.
19. N. Littlestone and M. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1994.
20. R. Nelson and D. Bessler. Subjective probabilities and scoring rules: Experimental evidence. American Journal of Agricultural Economics, 71(2):363-369, 1989.
21. K. Oliven and T. Rietz. Suckers are born, but markets are made: Individual rationality, arbitrage, and market efficiency on an electronic futures market. Management Science, 50(3):336-351, 2004.
22. R. Sinkhorn. A relationship between arbitrary positive matrices and doubly stochastic matrices. The Annals of Mathematical Statistics, 35(2):876-879, 1964.
23. R. Thaler and W. Ziemba. Anomalies: Parimutuel betting markets: Racetracks and lotteries. Journal of Economic Perspectives, 2(2):161-174, 1988.
24. S. Toda. PP is as hard as the polynomial-time hierarchy. SIAM Journal on Computing, 20(5):865-877, 1991.
25. L. Valiant. The complexity of computing the permanent. Theoretical Computer Science, 8:189-201, 1979.
26. L. Valiant. The complexity of enumeration and reliability problems. SIAM Journal of Computing, 8(3):410-421, 1979.
27. V. Vovk. A game of prediction with expert advice. Journal of Computer and System Sciences, 56:153-173, 1998.