MarkSAT W. E. Walsh and M. P. Wellman

Objectives Offer a decentralized computation model ; Study the computational properties of decentralized systems; Study how to use market model to solve SAT problems;

Supply Chain Formation A Task dependency network:  A directed, acyclic graph (V, E);  V = G ∪ A  G : goods, A : agents  A = C ∪ Π ∪ S  C : consumers, Π : producers, S : suppliers  E : edges  : agent a can provide a unit of good g;  : agent a requires a unit of good g;

Supply Chain Formation & 3SAT 3SAT can be transformed into supply chain formation problem; Supply chain formation problem is NP- Complete;

Implementation of Decentralization An agent knows only the information of the goods in which it is interested; An agent tries to maximize its surplus based on a price system; Protocol in price system: auction (price quotes and bidding); Global view: Local interaction Local price information Local decision making

Features Distributed More distributed than Yokoo’s approaches; Inefficient Much slower than GSAT; Two much communication;

Reference W. E. Walsh and M. P. Wellman, MarketSAT: An Extremely Decentralized (but Really Slow) Algorithm for Propositional Satisfiability, in Proceedings of 17’th National Conference on Artificial Intelligence, 2000;