Betting on permutations

EC'07 - Proceedings of the Eighth Annual Conference on Electronic Commerce

Volumn , Issue , 2007, Pages 326-335

  Chen, Yiling ^a   Fortnow, Lance ^b   Nikolova, Evdokia ^c   Pennock, David M ^a  

^a YAHOO RESEARCH   (United States)

^b THE UNIVERSITY OF CHICAGO   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Computational complexity; Expressive betting; Order matching; Prediction market

Indexed keywords

BETTING; NATURAL GREEDY ALGORITHM; PERMUTATIONS; POLYNOMIAL TIME;

APPROXIMATION ALGORITHMS; COMPUTATIONAL COMPLEXITY; ELECTRONIC COMMERCE; PROBLEM SOLVING; PROFESSIONAL ASPECTS;

INFORMATION TECHNOLOGY;

EID: 36448968204     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1250910.1250957     Document Type: Conference Paper

References (19)

1. K. J. Arrow. The role of securities in the optimal allocation of risk-bearing. Review of Economic Studies, 31(2):91-96, 1964.
2. J. E. Berg, R. Forsythe, F. D. Nelson, and T. A. Rietz. Results from a dozen years of election futures markets research. In C. A. Plott and V. Smith, editors, Handbook of Experimental Economic Results (forthcoming). 2001.
3. T. H. Gormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms (Second Edition). MIT Press and McGraw-Hill, 2001.
4. P. Cramton, Y. Shoham, and R. Steinberg. Combinatorial Auctions. MIT Press, Cambridge, MA, 2005.
5. R. Forsythe, T. A. Rietz, and T. W. Ross. Wishes, expectations, and actions: A survey on price formation in election stock markets. Journal of Economic Behavior and Organization, 39:83-110, 1999.
6. L. Fortnow, J. Kilian, D. M. Pennock, and M. P. Wellman. Betting boolean-style: A framework for trading in securities based on logical formulas. Decision Support Systems, 39(1):87-104, 2004.
7. M. Grötschel, L. Lovász, and A. Schrijver. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica, 1(2):169-197, 1981.
8. M. Grötschel, L. Lovász, and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin Heidelberg, 1993.
9. R. D. Hanson. Combinatorial information market design. Information Systems Frontiers, 5(1):107-119, 2003.
10. R. M. Karp. Reducibility among combinatorial problems. In Complexity of computer computations (Proc. Sympos., IBM Thomas J. Watson Res. Center, Yorktown Heights, N. Y.), pages 85-103. Plenum, New York, 1972.
11. M. Krivelevich, Z. Nutov, and R. Yuster. Approximation algorithms for cycle packing problems. Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 556-561, 2005.
12. H. W. Kuhn. The hungarian method for the assignment problem. Naval Research Logistic Quarterly, 2:83-97, 1955.
13. J. Munkres. Algorithms for the assignment and transportation problems. Journal of the Society of Industrial and Applied Mathematics, 5(1):32-38, 1957.
14. N. Nisan. Bidding and allocation in combinatorial auctions. In Proceedings of the 2nd ACM Conference on Electronic Commerce (EC'00), Minneapolis, MN, 2000.
15. D. M. Pennock, S. Lawrence, C. L. Giles, and F. A. Nielsen. The real power of artificial markets. Science, 291:987-988, February 2002.
16. C. Plott and S. Sunder. Efficiency of experimental security markets with insider information: An application of rational expectations models. Journal of Political Economy, 90:663-98, 1982.
17. C. Plott and S. Sunder. Rational expectations and the aggregation of diverse information in laboratory security markets. Econometrica, 56:1085-1118, 1988.
18. T. Sandholm. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135:1-54, 2002.
19. R. Yuster and Z. Nutov. Packing directed cycles efficiently. Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science. (MFCS), 2004.