Permutation betting markets: Singleton betting with extra information

Proceedings of the ACM Conference on Electronic Commerce

Volumn , Issue , 2008, Pages 180-189

  Ghodsi, Mohammad ^a   Mahini, Hamid ^a   Mirrokni, Vahab S ^b   Zadimoghaddam, Morteza ^a  

^a SHARIF UNIVERSITY OF TECHNOLOGY   (Iran)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Betting markets; Combinatorial algorithms; Linear programming; Matching markets; Prediction markets; Revenue maximization

Indexed keywords

ARBITRARY VALUES; BETTING MARKETS; COMBINATORIAL ALGORITHM; EXPECTED REVENUE; FREE MODEL; OPTIMUM SOLUTION; P-COMPLETE; POLYNOMIAL-TIME; POLYNOMIAL-TIME ALGORITHMS; PREDICTION MARKETS; REVENUE MAXIMIZATION; REVENUE MAXIMIZATION PROBLEM; SUFFICIENT CONDITIONS;

COMBINATORIAL MATHEMATICS; DYNAMIC PROGRAMMING; ELECTRIC CONDUCTIVITY MEASUREMENT; ELECTRONIC COMMERCE; LINEARIZATION; PROBLEM SOLVING; SET THEORY;

OPTIMIZATION;

EID: 76649126984     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1386790.1386821     Document Type: Conference Paper

References (24)

1. 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, 2001.
2. P. Cramton, Y. Shoham and R. Steinberg. Combinatorial Auctions. MIT Press, Cambridge, MA, 2005.
3. Y. Chen, L. Fortnow, E. Nikolova, D. Pennock. Betting on Permutations, Proceedings of the ACM Conference on Electronic Commerce, 2007.
4. D. Pennock. Personal Communications.
5. K. Dhamdhere, V. Goyal, R. Ravi, and M. Singh. How to pay, come what may: Approximation algorithms for demand-robust covering problems. FOCS, 2005.
6. 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
7. U. Feige. On maximizing welfare when utility functions are subadditive, STOC, 2006.
8. U. Feige, K. Jain, M. Mahdian, and V. S. Mirrokni. Robust Combinatorial Optimization with Exponential Number of Scenarios. Integer Programming and Combinatorial Optimization, 2007.
9. L. Fortnow, J. Kilian, D. Pennock, M. P. Wellman. Betting boolean-style: A framework for trading in securities based on logical formulas. Decision Support Systems, 39(1):87-104, 2004.
10. A. Gupta, M. Pal, R. Ravi, and A. Sinha. Boosted sampling: Approximation algorithms for stochastic optimization. In STOC, pages 170-178, 2004.
11. R.D. Hanson. Combinatorial information market design. Information Systems Frontiers, 5(1):107-119, 2003.
12. I. Heller, C.B. Tompkins. An extension of a theorem of Dantzig's, in: H.W. Kuhn, A.W. Tucker (Eds.), Linear Inequalities and Related Systems. Princeton University Press, Princeton, NJ, 1956, pp. 247-254.
13. N. Immorlica, D. Karger, M. Minkoff, and V. S. Mirrokni. On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In SODA, 2004.
14. B. Lehmann, D. Lehmann, and N. Nisan. Combinatorial Auctions with Decreasing Marginal Utilities, ACM EC 2001.
15. Y. Nikulin. Robustness in combinatorial optimization and scheduling theory: An annotated bibliography. Technical Report SOR-91-13, Statistics and Operation Research, 2004.
16. N. Nisan, T. Roughgarden, E. Tardos and V. Vazirani. Algorithmic Game Theory. Cambridge University Press, 2007.
17. D. M. Pennock, S. Lawrence, C. L. Giles, and F. A. Nielsen. The real power of artiŕcial markets. Science, 291:987-988, February 2002.
18. C. Papadimitriou, and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity N.Y. : Dover Publications, Inc., 1998.
19. 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-698, 1982
20. C. Plott and S. Sunder. Rational expectations and the aggregation of diverse information in laboratory security markets. Econometrica, 56:1085-1118, 1988.
21. T. Sandholm. Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence, 135:1-54, 2002.
22. A. Schrijver. Total Dual Integrality of Matching Forest Constraints. Combinatorica, 20:575-588, 2000.
23. D. Shmoys and S. Swamy. Stochastic optimization is (almost) as easy as deterministic optimization. In FOCS, 2004.
24. A. Schrijver, Combinatorial Optimization - Polyhedra and Efficiency, Springer-Verlag, Berlin, 2003.