Dependencies between players in Boolean games

  • Authors:
  • Elise Bonzon;Marie-Christine Lagasquie-Schiex;Jérôme Lang

  • Affiliations:
  • Université Paris Descartes, CRIP5, 45 rue des Saints-Pères, F-75270 Paris Cedex 06, France;Université de Toulouse, UPS, IRIT, 118 route de Narbonne, F-31062 Toulouse Cedex 9, France;Université Paris-Dauphine, LAMSADE, F-75775 Paris Cedex 16, France

  • Venue:
  • International Journal of Approximate Reasoning
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Boolean games are a logical setting for representing static games in a succinct way, taking advantage of the expressive power and succinctness of propositional logic. A Boolean game consists of a set of players, each of them controlling a set of propositional variables and having a specific goal expressed by a propositional formula, or more generally a specification of the player's preference relation in some logical language for compact preference representation, such as prioritized goals. There is a lot of graphical structure hidden in a Boolean game: the satisfaction of each player's goal depends on players whose actions have an influence on her goals. Exploiting this dependency structure facilitates the computation of pure Nash equilibria, by partly decomposing a game into several sub-games that are only loosely related.