Game-based CSP

Abstract

The search for a solution to a multi-criteria constraint optimisation problem can be shown to be analogous to game playing. By configuring agents to carry out game playing strategies within a constraint based search, gives a novel way of reaching solutions. In this paper, we describe how a constraint optimisation problem can be viewed as a game. For each formulation of a constraint problem as a game, the quality of solution depends on the gaming strategies employed by each player. We show that even when criteria are difficult to measure consistently, good balanced solutions can still be obtained using a heuristic approach