Compact preference representation for Boolean games
Bonzon, Elise; Lagasquie-Schiex, Marie-Christine; Lang, Jérôme (2006), Compact preference representation for Boolean games, in Yang, Quiang; Webb, Geoff, PRICAI 2006: Trends in Artificial Intelligence 9th Pacific Rim International Conference on Artificial Intelligence, Guilin, China, August 7-11, 2006, Proceedings, Springer : Berlin, p. 41-50. http://dx.doi.org/10.1007/978-3-540-36668-3_7
TypeCommunication / Conférence
Conference title9th Pacific Rim International Conference on Artificial Intelligence
Book titlePRICAI 2006: Trends in Artificial Intelligence 9th Pacific Rim International Conference on Artificial Intelligence, Guilin, China, August 7-11, 2006, Proceedings
Book authorYang, Quiang; Webb, Geoff
Series titleLecture Notes in Computer Science
Number of pages1263
MetadataShow full item record
Abstract (EN)Boolean games, introduced by [15,14], allow for expressing compactly two-players zero-sum static games with binary preferences: an agent’s strategy consists of a truth assignment of the propositional variables she controls, and a player’s preferences is expressed by a plain propositional formula. These restrictions (two-players, zero-sum, binary preferences) strongly limit the expressivity of the framework. While the first two can be easily encompassed by defining the agents’ preferences as an arbitrary n-uple of propositional formulas, relaxing the last one needs Boolean games to be coupled with a propositional language for compact preference representation. In this paper, we consider generalized Boolean games where players’ preferences are expressed within two of these languages: prioritized goals and propositionalized CP-nets.
Subjects / KeywordsCP-nets; Preference representation; Propositional logic; Game theory
Showing items related by title and author.