Thumbnail
Access Restriction
Open

Author Bonzon, Elise ♦ Lang, Jérôme
Source CiteSeerX
Content type Text
Publisher Springer
File Format PDF
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Subject Keyword Succinct Way ♦ Static Game ♦ Expressive Power ♦ Tak-ing Advantage ♦ Prioritized Goal ♦ Game Theory ♦ Graphical Structure ♦ Propositional Logic ♦ Dependency Structure ♦ Problem Decomposition ♦ Key Word ♦ Player Goal ♦ Specific Goal ♦ Propositional Variable ♦ Several Sub-games ♦ Compact Preference Representation ♦ Pure Nash Equilibrium ♦ Player Preference Relation ♦ Propositional Formula ♦ Boolean Game ♦ Logical Language ♦ Logical Setting
Description Boolean games are a logical setting for representing static games in a succinct way, tak-ing 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 speci-fication 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 compu-tation of pure Nash equilibria, by partly decomposing a game into several sub-games that are only loosely related. Key words: Game theory, compact preference representation, problem decomposition 1
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research
Education Level UG and PG ♦ Career/Technical Study
Learning Resource Type Article
Publisher Date 2007-01-01
Publisher Institution In Proc. ECSQARU ’07, volume 4724 of LNCS