On market-inspired approaches to propositional satisfiability

DOI10.1016/S0004-3702(02)00386-7zbMath1079.68623OpenAlexW1991871113WikidataQ62636513 ScholiaQ62636513MaRDI QIDQ814434

Katsutoshi Hirayama, Makoto Yokoo, Michael P. Wellman, William E. Walsh

Publication date: 7 February 2006

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0004-3702(02)00386-7

zbMATH Keywords

SatisfiabilityAuctionsDistributed constraint satisfactionMarket-oriented programming

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Bilateral trade with the sealed bid k-double auction: Existence and efficiency
• The Walras algorithm: A convergent distributed implementation of general equilibrium outcomes
• Conjectural equilibrium in multiagent learning
• Phase transitions and the search problem
• Experimental results on the crossover point in random 3-SAT
• Refining the phase transition in combinatorial search
• A machine program for theorem-proving
• On rational computability and communication complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On market-inspired approaches to propositional satisfiability