TY - JOUR
T1 - On market-inspired approaches to propositional satisfiability
AU - Walsh, William E.
AU - Yokoo, Makoto
AU - Hirayama, Katsutoshi
AU - Wellman, Michael P.
N1 - Funding Information:
The ideas for the MS-U and MS-D protocols were developed during a visit to the University of Michigan by the second author. The authors wish to thank NTT and Edmund H. Durfee for supporting the visit. Much of this work was performed while the first author was supported by a NASA/Jet Propulsion Laboratory Graduate Student Researcher Fellowship at the University of Michigan. This work was also supported in part by National Science Foundation Grant IIS-9988715.
PY - 2003/3
Y1 - 2003/3
N2 - We describe three market-inspired approaches to propositional satisfiability. The first is based on a formulation of satisfiability as production on a supply chain, where producers of particular variable assignments must acquire licenses to fail to satisfy particular clauses. Experiments show that although this general supply-chain protocol can converge to market allocations corresponding to satisfiable truth assignments, it is impractically slow. We find that a simplified market structure and a variation on the pricing method can improve performance significantly. We compare the performance of the three market-based protocols with distributed breakout algorithm and GSAT on benchmark 3-SAT problems. We identify a tradeoff between performance and economic realism in the market protocols, and a tradeoff between performance and the degree of decentralization between the market protocols and distributed breakout. We also conduct informal and experimental analyses to gain insight into the operation of price-guided search.
AB - We describe three market-inspired approaches to propositional satisfiability. The first is based on a formulation of satisfiability as production on a supply chain, where producers of particular variable assignments must acquire licenses to fail to satisfy particular clauses. Experiments show that although this general supply-chain protocol can converge to market allocations corresponding to satisfiable truth assignments, it is impractically slow. We find that a simplified market structure and a variation on the pricing method can improve performance significantly. We compare the performance of the three market-based protocols with distributed breakout algorithm and GSAT on benchmark 3-SAT problems. We identify a tradeoff between performance and economic realism in the market protocols, and a tradeoff between performance and the degree of decentralization between the market protocols and distributed breakout. We also conduct informal and experimental analyses to gain insight into the operation of price-guided search.
UR - http://www.scopus.com/inward/record.url?scp=0037371780&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0037371780&partnerID=8YFLogxK
U2 - 10.1016/S0004-3702(02)00386-7
DO - 10.1016/S0004-3702(02)00386-7
M3 - Article
AN - SCOPUS:0037371780
VL - 144
SP - 125
EP - 156
JO - Artificial Intelligence
JF - Artificial Intelligence
SN - 0004-3702
IS - 1-2
ER -