We describe MarketSAT, a highly decentralized, market-based algorithm for propositional satisfiability. The approach is based on a formulation of satisfiability as production on a supply chain, where producers of particular variable as-signments must acquire licenses to fail to satisfy particular clauses. MarketSAT employs a market protocol for general supply chain problems, which we show to be expressively equivalent to 3SAT. Experiments suggest that MarketSAT re-liably converges to market allocations corresponding to sat-isfiable truth assignments. We experimentally compare the computational performance with GSAT, a centralized local search algorithm
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.