.png){kind=icon}
.png){kind=icon}
Return
Dependencies between players in Boolean games
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2009.02.008.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
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 tier 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. (C) 2009 Published by Elsevier Inc.
Keywords:
Game theory
Compact preference representation
Problem decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
2.9K
Citations:
5.1K
Organization
View more organizations