On market-inspired approaches to propositional satisfiability

Authors:
William E. Walsh;Makoto Yokoo;Katsutoshi Hirayama;Michael P. Wellman
Affiliations:
University of Michigan AI Laboratory, Ann Arbor, MI;NTT Communication Science Laboratories, Kyoto, Japan;Kobe University of Mercantile Marine, Kobe, Japan;University of Michigan AI Laboratory, Ann Arbor, MI
Venue:
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Year:
2001

Citing 7
Cited 5

Flexible double auctions for electionic commerce: theory and implementation

Decision Support Systems - Special issue on economics of electronic commerce
Distributed constraint satisfaction: foundations of cooperation in multi-agent systems

Distributed constraint satisfaction: foundations of cooperation in multi-agent systems
Algorithms for Distributed Constraint Satisfaction: A Review

Autonomous Agents and Multi-Agent Systems
MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Generating Satisfiable Problem Instances

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Distributed Constraint Satisfaction Algorithm for Complex Local Problems

ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems
A Market Protocol for Decentralized Task Allocation

ICMAS '98 Proceedings of the 3rd International Conference on Multi Agent Systems

Local search for distributed SAT with complex local problems

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 3
On market-inspired approaches to propositional satisfiability

Artificial Intelligence
Protocol/Mechanism Design for Cooperation/Competition

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1
The distributed breakout algorithms

Artificial Intelligence - Special issue: Distributed constraint satisfaction
The distributed breakout algorithms

Artificial Intelligence - Special issue: Distributed constraint satisfaction

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe two market-inspired approaches to propositional satisfiability. Whereas a previous market-inspired approach exhibited extremely slow performance, we find that variations on the pricing method with a simplified market structure can improve performance significantly. We compare the performance of the new protocols with the previous market protocol and with the distributed breakout algorithm on benchmark 3-SAT problems. We identify a tradeoff between performance and economic realism in the new market protocols, and a tradeoff between performance and the degree of decentralization between the new market protocols and distributed breakout. We also conduct informal and experimental analyses to gain insight into the operation of price-guided search.