Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apt, K.R., Rossi, F., Venable, K.B.: CP-nets and Nash equilibria. In: Elsevier (ed.) Proc. CIRAS 2005 (Third International Conference on Computational Intelligence, Robotics and Autonomous Systems), Singapore, December 13-16 (2005)
Benferhat, S., Cayrol, C., Dubois, D., Lang, J., Prade, H.: Inconsistency management and prioritized syntax-based entailment. In: Proc. of the 13th IJCAI, pp. 640–645 (1993)
Bonzon, E., Lagasquie-Schiex, M., Lang, J., Zanuttini, B.: Boolean games revisited (2006), available at ftp:ftp.irit.fr/pub/IRIT/RPDMP/ecai06.ps.gz
Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., Poole, D.: Cp-nets: A tool for representing and reasoning with conditional Ceteris Paribus preference statements. Journal of Artificial Intelligence Research 21, 135–191 (2004)
Boutilier, C., Brafman, R., Domshlak, C., Hoos, H., Poole, D.: Preference-based constrained optimization with cp-nets. Computational Intelligence 20(2), 137–157 (2004) Special Issue on Preferences
Boutilier, C., Brafman, R.I., Hoos, H.H., Poole, D.: Reasoning with conditional ceteris paribus preference statements. In: Proc. of UAI (1999)
Brewka, G.: Preferred subtheorie: An extended logical framework for default reasoning. In: Proc. of the 11th IJCAI, pp. 1043–1048 (1989)
Coste-Marquis, S., Lang, J., Liberatore, P., Marquis, P.: Expressive power and succinctness of propositional languages for preference representation. In: Proc. of the 9th KR, pp. 203–212 (2004)
De Vos, M., Vermeir, D.: Choice logic programs and Nash equilibria in strategic games. In: Flum, J., Rodríguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 266–276. Springer, Heidelberg (1999)
Dubois, D., Lang, J., Prade, H.: Inconsistency in possibilistic knowledge bases: To live with it or not live with it. In: Fuzzy Logic for the Management of Uncertainty, pp. 335–351. Wiley, Chichester (1992)
Dunne, P.E., van der Hoek, W.: Representation and complexity in boolean games. In: Alferes, J.J., Leite, J.A. (eds.) JELIA 2004. LNCS (LNAI), vol. 3229, pp. 347–359. Springer, Heidelberg (2004)
Foo, N., Meyer, T., Brewka, G.: LPOD answer sets and Nash equilibria. In: Maher, M.J. (ed.) ASIAN 2004. LNCS, vol. 3321, pp. 343–351. Springer, Heidelberg (2004)
Geffner, H.: Default reasoning: causal and conditional theories. MIT Press, Cambridge (1992)
Harrenstein, P.: Logic in Conflict. PhD thesis, Utrecht University (2004)
Harrenstein, P., van der Hoek, W., Meyer, J.J., Witteveen, C.: Boolean games. In: Proc. of TARK, pp. 287–298 (2001)
Lang, J.: Logical preference representation and combinatorial vote. Annals of Mathematics and Artificial Intelligence 42, 37–71 (2004)
Lehmann, D.: Another perspective on default reasoning. Annals of Mathematics and Artificial Intelligence 15, 61–82 (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonzon, E., Lagasquie-Schiex, MC., Lang, J. (2006). Compact Preference Representation for Boolean Games. In: Yang, Q., Webb, G. (eds) PRICAI 2006: Trends in Artificial Intelligence. PRICAI 2006. Lecture Notes in Computer Science(), vol 4099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36668-3_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-36668-3_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36667-6
Online ISBN: 978-3-540-36668-3
eBook Packages: Computer ScienceComputer Science (R0)