Representing utility functions via weighted goals

Mathematical Logic Quarterly

Volumn 55, Issue 4, 2009, Pages 341-361

  Uckelman, Joel ^a   Chevaleyre, Yann ^b   Endriss, Ulle ^a   Lang, Jérôme ^b  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

^b UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Computational complexity; Computational social choice; Preference representation

Indexed keywords

EID: 70349085436     PISSN: 09425616     EISSN: 15213870     Source Type: Journal    
DOI: 10.1002/malq.200810024     Document Type: Article

References (37)

1. K. J. Arrow, A. K. Sen, and K. Suzumura (eds.), Handbook of Social Choice and Welfare (North-Holland, 2002).
2. Y. Chevaleyre, U. Endriss, J. Lang, and N. Maudet, A short introduction to computational social choice. In: Proc. 33rd Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM-2007)(J. van Leeuwen, G. F. Italiano, W. van der Hoek, C. Meinel, H. Sack, and F. Plasil, eds.) LNCS Vol. 4362, pp. 51-69 (Springer-Verlag, 2007).
3. J. Doyle and M. P. Wellman, Preferential semantics for goals. In: Proc. 9th National Conference on Artificial Intelligence (AAAI-1991), pp. 698-703 (AAAI Press, 1991).
4. C. Boutilier, R. I. Brafman, C. Domshlak, H. H. Hoos, and D. Poole, CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. Journal of Artifcial Intelligence Research (JAIR) 21, 135-191 (2004).
5. J. Lang,Logical preference representation and combinatorial vote. Annals of Mathematics and Artificial Intelligence 42, 37-71 (2004).
6. F. Bacchus and A. J. Grove, Utility independence in a qualitative decision theory. In: Proc. 5th International Conference on Principles of Knowledge Representation and Reasoning (KR-1996), pp. 542-552 (Morgan Kaufmann, 1996).
7. P. La Mura and Y. Shoham, Expected utility networks. In: Proc. 15th Conference on Uncertainty in Artificial Intelligence (UAI-1999), pp. 366-373 (Morgan Kaufmann, 1999).
8. C. Boutilier, F. Bacchus, and R. Brafman, UCP-networks: A directed graphical representation of conditional utilities. In: Proc. 17th Conference on Uncertainty in Artificial Intelligence (UAI-2001), pp. 56-64 (Morgan Kaufmann, 2001).3
9. C. Gonzales and P. Perny, GAI networks for utility elicitation. In: Proc. 9th International Conference on Principles of Knowledge Representation and Reasoning (KR-2004), pp. 224-234 (AAAI Press, 2004).
10. C. Boutilier, R. Dearden, and M. Goldszmidt, Exploiting structure in policy construction. In: Proc. 14th International Joint Conference on Artificial Intelligence (IJCAI-1995), pp. 1104-1113 (Morgan Kaufmann, 1995).
11. S. Bistarelli, H. Fargier, U. Montanar, F. Rossi, T. Schiex, and G. Verfaillie, Semiring-based CSPs and valued CSPs: Frameworks, properties and comparison. Constraints 4, 199-240 (1999).
12. N. Nisan, Bidding languages for combinatorial auctions. In: Combinatorial Auctions (P. Cramton, Y. Shoham, and R. Steinberg, eds.) (MIT Press, 2006).
13. C. Boutilier and H. H. Hoos, Bidding languages for combinatorial auctions. In: Proc. 17th International Joint Conference on Artificial Intelligence (IJCAI-2001), pp. 1211-1217 (Morgan Kaufmann, 2001).
14. T. W. Sandholm, Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence 135, 1-54 (2002).
15. G. Pinkas, Reasoning, nonmonotonicity and learning in connectionist networks that capture propositional knowledge. Artificial Intelligence 77, 203-247 (1995).
16. C. Lafage and J. Lang, Logical representation of preferences for group decision making. In: Proc. 7th International Conference on Principles of Knowledge Representation and Reasoning (KR-2000), pp. 457-468 (Morgan Kaufmann, 2000).
17. J. Uckelman and U. Endriss, Preference modeling by weighted goals with max aggregation. In: Proc. 11th International Conference on Principles of Knowledge Representation and Reasoning (KR-2008), pp. 579-587 (AAAI Press, 2008).
18. S. Coste-Marquis, J. Lang, P. Liberatore, and P. Marquis, Expressive power and succinctness of propositional languages for preference representation. In: Proc. 9th International Conference on Principles of Knowledge Representation and Reasoning (KR-2004), pp. 203-212 (AAAI Press, 2004).
19. P. Haddawy and S. Hanks, Representations for decision-theoretic planning: Utility functions for deadline goals. In: Proc. 4th International Conference on Principles of Knowledge Representation and Reasoning (KR-1994), pp. 71-82 (Morgan Kaufmann, 1992).
20. F. Dupin de Saint-Cyr, J. Lang, and T. Schiex, Penalty logic and its link with Dempster-Shafer theory. In: Proc. 10th Conference on Uncertainty in Artificial Intelligence (UAI-1994), pp. 204-211 (Morgan Kaufmann, 1994).
21. S. Ieong and Y. Shoham, Marginal contribution nets: A compact representation scheme for coalitional games. In: Proc. 6th ACM Conference on Electronic Commerce (EC-2005), pp. 193-202 (ACM Press, 2005).
22. E. Elkind, L. A. Goldberg, P. W. Goldberg, and M. Wooldridge, A tractable and expressive class of marginal contribution nets and its applications. In: Proceedings of the 7th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2008), pp. 1007-1014 (IFAAMAS, 2008).
23. G. C. Rota, On the foundations of combinatorial theory I: Theory of Möbius functions. Zeitschrift für Wahrschein-lichkeitstheorie und Verwandte Gebiete 2, 340-368 (1964).
24. M. Grabisch, k-order additive discrete fuzzy measures and their representation. Fuzzy Sets and Systems 92, 167-189 (1997).
25. V. Conitzer, T. W. Sandholm, and P. Santi, Combinatorial auctions with k-wise dependent valuations. In: Proc. 20th National Conference on Artificial Intelligence (AAAI-05), pp. 248-254 (AAAI Press, 2005).
26. Y. Chevaleyre, U. Endriss, S. Estivie, and N. Maudet, Multiagent resource allocation in k-additive domains: Preference representation and complexity. Annals of Operations Research 163, 49-62 (2008).
27. J. S. Rosenschein and G. Zlotkin, Rules of Encounter (MIT Press, 1994).
28. H. Moulin, Axioms of Cooperative Decision Making (Cambridge University Press, 1988).
29. A. P. Dempster, Upper and lower probabilities induced by a multivaluated mapping. Annals of Mathematical Statistics 38, 325-339 (1967).
30. G. Shafer, A Mathematical Theory of Evidence (Princeton University Press, Princeton, NJ, 1976).
31. M. Cadoli, F. M. Donini, P. Liberatore, and M. Schaerf, Space efficiency of propositional knowledge representation formalisms. Journal of Artificial Intelligence Research (JAIR) 13, 1-31 (2000).
32. Y. Mansour, Learning Boolean functions via the Fourier transform. In: Theoretical Advances in Neural Computation and Learning (Kluwer, 1994).
33. L. Trevisan, Lecture notes 25, CS278: Computational complexity, UC-Berkeley, December 1, 2004, http://www.cs.berkeley.edu/luca/cs278/notes/lecture25.pdf.
34. T. Lee, Kolmogorov Complexity and Formula Size Lower Bounds. PhD thesis, Institute for Logic, Language and Computation, University of Amsterdam, 2006.
35. J. Uckelman and A. Witzel, Logic-based preference languages with intermediate complexity. In: Proceedings of the 4th Multidisciplinary Workshop on Advances in Preference Handling (MPREF-2008), pp. 123-127 (AAAI Press, 2008).
36. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-completeness (W.H. Freeman and Co., 1979).
37. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi, Complexity and Approximation (Springer-Verlag, 1999).