MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 303-309

  Walsh, William E ^a   Wellman, Michael P ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMMERCE; FORMAL LOGIC;

CENTRALISED; COMPUTATIONAL PERFORMANCE; DECENTRALISED; LOCAL SEARCH ALGORITHM; PROPOSITIONAL SATISFIABILITY; SATISFIABILITY; TRUTH ASSIGNMENT; VARIABLE ASSIGNMENT;

SUPPLY CHAINS;

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

References (15)

1. Cheng, J. Q., and Wellman, M. P. 1998. The WALRAS algorithm: A convergent distributed implementation of general equilibrium outcomes. Computational Economics 12:1-24.
2. Crawford, J. M., and Auton, L. D. 1996. Experimental results on the crossover point in random 3-SAT. Artificial Intelligence 81:31-57.
3. Fujishima, Y.; Leyton-Brown, K.; and Shoham, Y. 1999. Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In Sixteenth International Joint Conference on Artificial Intelligence, 548-553.
4. Mitchell, D.; Selman, B.; and Levesque, H. 1992. Hard and easy distributions of SAT problems. In Tenth National Conference on Artificial Intelligence, 459-465.
5. Samuelson, P. A. 1949. Market mechanisms and maximization. Research memorandum, RAND. Available in The Collected Scientific Papers of Paul A. Samuelson, Stiglitz, J. E., ed., 1966.
6. Sandholm, T. 1999. An algorithm for optimal winner determination in combinatorial auctions. In Sixteenth International Joint Conference on Artificial Intelligence, 542-547.
7. Satterthwaite, M. A., and Williams, S. R. 1989. Bilateral trade with the sealed bid k-double auction: Existence and efficiency. Journal of Economic Theory 48:107-133.
8. Selman, B.; Levesque, H.; and Mitchell, D. 1992. A new method for solving hard satisfiability problems. In Tenth National Conference on Artificial Intelligence, 440-446.
9. Shoham, Y., and Tennenholtz, M. to appear. Rational computability and communication complexity. Games and Economic Behavior.
10. Walsh, W. E., and Wellman, M. P. 1998. A market protocol for decentralized task allocation. In Third International Conference on Multi-Agent Systems, 325-332.
11. Walsh, W. E., and Wellman, M. P. 1999. Efficiency and equilibrium in task allocation economies with hierarchical dependencies. In Sixteenth International Joint Conference on Artificial Intelligence, 520-526.
12. Wurman, P. R.; Walsh, W. E.; and Wellman, M. P. 1998. Flexible double auctions for electronic commerce: Theory and implementation. Decision Support Systems 24:17-27.
13. Wurman, P. R.; Wellman, M. P.; and Walsh, W. E. 1998. The Michigan Internet AuctionBot: A configurable auction server for human and software agents. In Second International Conference on Autonomous Agents, 301-308.
14. Ygge, F., and Akkermans, H. 1998. On resource-oriented multi-commodity market computations. In Third International Conference on Multi-Agent Systems, 365-371.
15. Yokoo, M.; Durfee, E. H.; Ishida, T.; and Kuwabara, K. 1998. The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering 10(5):673-685.