资源论文An Ef?cient Monte-Carlo Algorithm for Pricing Combinatorial Prediction Markets for Tournaments

An Ef?cient Monte-Carlo Algorithm for Pricing Combinatorial Prediction Markets for Tournaments

2019-11-12 | |  50 |   44 |   0
Abstract Computing the market maker price of a security in a combinatorial prediction market is #P-hard. We devise a fully polynomial randomized approximation scheme (FPRAS) that computes the price of any security in disjunctive normal form (DNF) within an  multiplicative error factor in time polynomial in 1/ and the size of the input, with high probability and under reasonable assumptions. Our algorithm is a Monte-Carlo technique based on importance sampling. The algorithm can also approximately price securities represented in conjunctive normal form (CNF) with additive error bounds. To illustrate the applicability of our algorithm, we show that many securities in Yahoo!’s popular combinatorial prediction market game called Predictalot can be represented by DNF formulas of polynomial size.

上一篇:A Maximum Likelihood Approach towards Aggregating Partial Orders

下一篇:Improving Resource Allocation Strategy Against Human Adversaries in Security Games

用户评价
全部评价

热门资源

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • Rating-Boosted La...

    The performance of a recommendation system reli...

  • Hierarchical Task...

    We extend hierarchical task network planning wi...