Compact Preference Representation for Boolean Games
نویسندگان
چکیده
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.
منابع مشابه
A Combination of Boolean Games with Description Logics for Automated Multi-Attribute Negotiation
Multi-attribute negotiation has been extensively studied from a gametheoretic viewpoint. In negotiation settings, utility functions are used to express agent preferences. Normal and extensive form games, however, have the drawback of requiring an explicit representation of utility functions, listing the utility values for all combinations of strategies. Therefore, several logical preference lan...
متن کاملDependencies Between Players in Boolean Games
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 r...
متن کاملA Complete Solver for Constraint Games
1 Game Theory studies situations in which multiple agents having conflicting objectives have to reach a collective decision. The question of a compact representation language for agents utility function is of crucial importance since the classical representation of a n-players game is given by a n-dimensional matrix of exponential size for each player. In this paper we use the framework of Cons...
متن کاملCore Membership Computation for Succinct Representations of Coalitional Games
In this paper, I compare and contrast two formal results on the computational complexity of core membership determination in two compact representations of coalitional games. Conitzer and Sandholm [1] proposed the multi-issue representations of coalitional games. This representation attempts to decompose a coalitional games into a set of sub-games. Later, Ieong and Shoham [3] proposed the margi...
متن کاملAn Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کامل