MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability
暂无分享,去创建一个
[1] Makoto Yokoo,et al. The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..
[2] Michael P. Wellman,et al. Efficiency and Equilibrium in Task Allocation Economies with Hierarchical Dependencies , 1999, IJCAI.
[3] Michael P. Wellman,et al. Flexible double auctions for electronic commerce: theory and implementation , 1998, Decis. Support Syst..
[4] Steven R. Williams,et al. Bilateral trade with the sealed bid k-double auction: Existence and efficiency , 1989 .
[5] Michael P. Wellman,et al. A market protocol for decentralized task allocation , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).
[6] Tuomas Sandholm,et al. An algorithm for optimal winner determination in combinatorial auctions , 1999, IJCAI 1999.
[7] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.
[8] James M. Crawford,et al. Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..
[9] Hector J. Levesque,et al. A New Method for Solving Hard Satisfiability Problems , 1992, AAAI.
[10] Yoav Shoham,et al. Taming the Computational Complexity of Combinatorial Auctions: Optimal and Approximate Approaches , 1999, IJCAI.
[11] Michael P. Wellman,et al. The Michigan Internet AuctionBot: a configurable auction server for human and software agents , 1998, AGENTS '98.
[12] Hans Akkermans,et al. On resource-oriented multi-commodity market computations , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).
[13] Michael P. Wellman,et al. The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes , 1998 .