On market-inspired approaches to propositional satisfiability

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2001, Pages 1152-1158

  Walsh, William E ^a   Yokoo, Makoto ^b   Hirayama, Katsutoshi ^c   Wellman, Michael P ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

^b Nippon Telegraph and Telephone Corporation   (Japan)

^c KOBE UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

3-SAT PROBLEMS; EXPERIMENTAL ANALYSIS; GAIN INSIGHT; IMPROVE PERFORMANCE; MARKET STRUCTURES; NEW PROTOCOL; PRICING METHODS; PROPOSITIONAL SATISFIABILITY;

ARTIFICIAL INTELLIGENCE;

BENCHMARKING;

EID: 0002928945     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Dimitris Achlioptas, Carla Gomes, Henry Kautz, and Bart Selman. Generating satisfiable problem instances. In Seventeenth National Converence on Artificial Intelligence, pages 256-261, 2000.
2. Peter Cheeseman, Bob Kanefsky, and William M. Taylor. Where the Really hard problems are. In Twelfth International Joint Conference on Artificial Intelligence, pages 331-337, 1991.
3. David Mitchell, Bart Selman, and Hector Levesque. Hard and easy distributions of SAT problems. In Tenth National Conference on Artificial Intelligence, pages 459-465, 1992.
4. Paul Morris. The breakout method for escaping from local minima. In Eleventh National Conference on Aritificial Intelligence, pages 40-45, 1993.
5. Bart Selman, Hector Levesque, and David Mitchell. A new method for solving hard satisfiability problems. In Tenth National Conference on Artificial Intelligence, pages 440-446, 1992.
6. Yoav Shoham and Moshe Tennenholtz. On rational computability and communication complexity. Games and Economic Behavior, to appear.
7. William E. Walsh and Michael P. Wellman. A market protocol for decentralized task allocation. In Third International Conference on Multi-Agent Systems, pages 325-332, 1998.
8. William E. Walsh and Michael P. Wellman. MarketSAT: An extremely decentralized (but really slow) algorithm for propositional satisfiability. In Seventeenth National Conference on Artificial Intelligence, pages 303-309, 2000.
9. Peter R. Wurman, William E. Walsh, and Michael P. Wellman. Flexible double auctions for electronic commerce: Theory and implementation. Decision Support Systems, 24:17-27, 1998.
10. Makoto Yokoo and Katsutoshi Hirayama. Distributed breakout algorithm for solving distributed constraint satisfaction problems. In Second International Conference on Multi-Agent Systems, pages 401-408, 1996.
11. Makoto Yokoo and Katsutoshi Hirayama. Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems, 3(2):198-212, 2000.
12. Makoto Yokoo. Distributed Constraint Satisfaction: Foundation of Cooperation in Multi-agent Systems. Springer, 2000.