On the computational complexity of qualitative coalitional games

  • Authors:
  • Michael Wooldridge;Paul E. Dunne

  • Affiliations:
  • Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, United Kingdom;Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, United Kingdom

  • Venue:
  • Artificial Intelligence
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Boolean satisfiability (SAT) and maximum satisfiability (Max-SAT) are difficult combinatorial problems that have many important real-world applications. In this paper, we first investigate the configuration landscapes of local minima reached by the WalkSAT ...