Permutation Betting Markets: Singleton Betting with Extra Information

Springer Science and Business Media LLC - Tập 60 - Trang 853-876 - 2009
Mohammad Ghodsi1, Hamid Mahini1, Vahab S. Mirrokni2, Morteza Zadimoghaddam1
1Department of Computer Engineering, Sharif University of Technology, Tehren, Iran
2Microsoft Research, Redmond, USA

Tóm tắt

We study permutation betting markets, introduced by Chen et al. (Proceedings of the ACM Conference on Electronic Commerce, 2007). For these markets, we consider subset bettings in which each trader can bet on a subset of candidates ending up in a subset of positions. We consider the revenue maximization problem for the auctioneer in two main frameworks: the risk-free revenue maximization (studied in Chen et al., Proceedings of the ACM Conference on Electronic Commerce, 2007), and the probabilistic revenue maximization. We also explore the use of some certain knowledge or extra information about the possible outcomes of the market. We first show that finding the optimal revenue in the risk-free model for the subset betting problem is inapproximable. This resolves an open question posed by Chen et al. (Proceedings of the ACM Conference on Electronic Commerce, 2007). In order to identify solvable variants of the problem, we propose the singleton betting language which allows traders to bet an arbitrary value on one candidate for one position. For singleton bettings, we first provide a linear-time implementable necessary and sufficient condition for existence of a solution with positive revenue for any possible outcome. Furthermore, we develop an LP-based polynomial-time algorithm to find the optimum solution of this problem. In addition, we show how to extend this LP-based method to handle some extra information about the possible outcomes. Finally, we consider the revenue maximization problem in a probabilistic setting. For this variant, we observe that the problem of maximizing the expected revenue is polynomial-time solvable, but we show that maximizing the probability of achieving a pre-specified revenue is #P-Complete.

Tài liệu tham khảo

Chen, Y., Fortnow, L., Nikolova, E., Pennock, D.: Betting on permutations. In: Proceedings of the ACM Conference on Electronic Commerce (2007)

Plott, C., Sunder, S.: Efficiency of experimental security markets with insider information: An application of rational expectations models. J. Polit. Econ. 90, 663–698 (1982)

Plott, C., Sunder, S.: Rational expectations and the aggregation of diverse information in laboratory security markets. Econometrica 56, 1085–1118 (1988)

Berg, J.E., Forsythe, R., Nelson, F.D., Rietz, T.A.: Results from a dozen years of election futures markets research. In: Plott, C.A., Smith, V. (eds.) Handbook of Experimental Economic Results. Elsevier, North-Holland (2001)

Forsythe, R., Rietz, T.A., Ross, T.W.: Wishes, expectations, and actions: A survey on price formation in election stock markets. J. Econ. Behav. Organ. 39, 83–110 (1999)

Pennock, D.M., Lawrence, S., Giles, C.L., Nielsen, F.A.: The real power of artificial markets. Science 291, 987–988 (2002)

Dhamdhere, K., Goyal, V., Ravi, R., Singh, M.: How to pay, come what may: Approximation algorithms for demand-robust covering problems. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS) (2005)

Ghodsi, M., Mahini, H., Mirrokni, V.S., Zadimoghaddam, M.: Permutation betting markets: singleton betting with extra information. In: Proceedings of the ACM Conference on Electronic Commerce (2008)

Nikulin, Y.: Robustness in combinatorial optimization and scheduling theory: An annotated bibliography. Technical Report SOR-91-13, Statistics and Operation Research (2004)

Feige, U., Jain, K., Mahdian, M., Mirrokni, V.S: Robust combinatorial optimization with exponential number of scenarios. In: Proceedings of the Conference on Integer Programming and Combinatorial Optimization (2007)

Immorlica, N., Karger, D., Minkoff, M., Mirrokni, V.S.: On the costs and benefits of procrastination: Approximation algorithms for stochastic combinatorial optimization problems. In: Proceedings Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2004)

Gupta, A., Pal, M., Ravi, R., Sinha, A.: Boosted sampling: Approximation algorithms for stochastic optimization. In: Proceedings of the Annual ACM Symposium on Theory of Computing (STOC) (2004)

Shmoys, D., Swamy, S.: Stochastic optimization is (almost) as easy as deterministic optimization. In: Proceedings of the Annual Symposium on Foundations of Computer Science (FOCS) (2004)

Pennock, D.: Personal communications

Fortnow, L., Kilian, J., Pennock, D., Wellman, M.P.: Betting boolean-style: A framework for trading in securities based on logical formulas. Decis. Support Syst. 39(1), 87–104 (2004)

Hanson, R.D.: Combinatorial information market design. Inf. Syst. Front. 5(1), 107–119 (2003)

Cramton, P., Shoham, Y., Steinberg, R.: Combinatorial Auctions. MIT Press, Cambridge (2005)

Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)

Lehmann, B., Lehmann, D., Nisan, N.: Combinatorial auctions with decreasing marginal utilities. In: Proceedings of the ACM Conference on Electronic Commerce (EC) (2001)

Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artif. Intell. 135, 1–54 (2002)

Feige, U.: On maximizing welfare when utility functions are subadditive. In: Proceedings of the Annual ACM Symposium on Theory of Computing (STOC) (2006)

Schrijver, A.: Total dual integrality of matching forest constraints. Combinatorica 20, 575–588 (2000)

Papadimitriou, C., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Dover, New York (1998)

Schrijver, A.: Combinatorial Optimization—Polyhedra and Efficiency. Springer, Berlin (2003)

Heller, I., Tompkins, C.B.: An extension of a theorem of Dantzig’s. In: Kuhn, H.W., Tucker, A.W. (eds.) Linear Inequalities and Related Systems, pp. 247–254. Princeton University Press, Princeton (1956)

Thông tin
Thông tin xuất bản

Springer Science and Business Media LLC

Tập 60

853-876

Thông tin tác giả