Dependencies between players in Boolean games
Bonzon, Elise; Lagasquie-Schiex, Marie-Christine; Lang, Jérôme (2009), Dependencies between players in Boolean games, International Journal of Approximate Reasoning, 50, 6, p. 899-914. http://dx.doi.org/10.1016/j.ijar.2009.02.008
TypeArticle accepté pour publication ou publié
Journal nameInternational Journal of Approximate Reasoning
MetadataShow full item record
Abstract (EN)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.
Subjects / KeywordsProblem decomposition; Compact preference representation; Game theory
Showing items related by title and author.