Generalized Weighted Model Counting: An Efficient Monte-Carlo Meta-Algorithm

In this paper, we focus on computing the prices of secu- rities represented by logical formulas in combinatorial prediction markets when the price function is represented by a Bayesian network. This problem turns out to be a natural extension of the weighted model counting (WMC) problem (Sang, Bearne, and Kautz 2005), which we call generalized weighted model counting (GWMC) problem. In GWMC, we are given a logical formula F and a polynomial-time computable weight function. We are asked to compute the total weight of the valuations that satisfy F. Based on importance sampling, we propose a Monte-Carlo meta-algorithm that has a good theoretical guarantee for formulas in disjunctive normal form (DNF). The meta-algorithm queries an oracle algorithm that computes marginal probabilities in Bayesian networks, and has the following theoretical guarantee. When the weight function can be approximately represented by a Bayesian network for which the oracle algorithm runs in polynomial time, our meta-algorithm becomes a fully polynomial-time randomized approximation scheme (FPRAS).

[1]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[2]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems - networks of plausible inference , 1991, Morgan Kaufmann series in representation and reasoning.

[3]  Carmel Domshlak,et al.  Probabilistic Planning via Heuristic Forward Search and Weighted Model Counting , 2007, J. Artif. Intell. Res..

[4]  Michael P. Wellman,et al.  Betting boolean-style: a framework for trading in securities based on logical formulas , 2003, EC '03.

[5]  Pascal Poupart,et al.  Exploiting Structure in Weighted Model Counting Approaches to Probabilistic Inference , 2014, J. Artif. Intell. Res..

[6]  Vibhav Gogate,et al.  Studies in Solution Sampling , 2008, AAAI.

[7]  Rina Dechter,et al.  Generating random solutions for constraint satisfaction problems , 2002, AAAI/IAAI.

[8]  Thomas A. Rietz,et al.  Prediction market accuracy in the long run , 2008 .

[9]  Lance Fortnow,et al.  Complexity of combinatorial market makers , 2008, EC '08.

[10]  Richard M. Karp,et al.  Monte-Carlo Approximation Algorithms for Enumeration Problems , 1989, J. Algorithms.

[11]  Robin Hanson,et al.  Combinatorial Information Market Design , 2003, Inf. Syst. Frontiers.

[12]  Gregory F. Cooper,et al.  The Computational Complexity of Probabilistic Inference Using Bayesian Belief Networks , 1990, Artif. Intell..

[13]  Adnan Darwiche,et al.  On probabilistic inference by weighted model counting , 2008, Artif. Intell..

[14]  R. Hanson.  LOGARITHMIC MARKETS CORING RULES FOR MODULAR COMBINATORIAL INFORMATION AGGREGATION , 2012 .

[15]  David M. Pennock,et al.  Price Updating in Combinatorial Prediction Markets with Bayesian Networks , 2011, UAI.

[16]  David M. Pennock,et al.  Pricing combinatorial markets for tournaments , 2008, STOC.

[17]  Bart Selman,et al.  Towards Efficient Sampling: Exploiting Random Walk Strategies , 2004, AAAI.

[18]  Thomas Hofmann,et al.  Near-Uniform Sampling of Combinatorial Spaces Using XOR Constraints , 2007 .

[19]  David M. Pennock,et al.  Designing Markets for Prediction , 2010, AI Mag..

[20]  David M. Pennock,et al.  An Efficient Monte-Carlo Algorithm for Pricing Combinatorial Prediction Markets for Tournaments , 2011, IJCAI.

[21]  Thomas A. Rietz,et al.  Results from a Dozen Years of Election Futures Markets Research , 2008 .

[22]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[23]  Henry A. Kautz,et al.  Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.