Preference representation with weighted goals: Expressivity, succinctness, complexity

AAAI Workshop - Technical Report

Volumn WS-07-10, Issue , 2007, Pages 85-92

  Uckelman, Joel ^a   Endriss, Ulle ^a  

^a UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

AI SYSTEMS; PREFERENCE REPRESENTATION; PROPOSITIONAL FORMULAS; SUBLANGUAGES; TECHNICAL REPORTS; UTILITY FUNCTIONS;

ARTIFICIAL INTELLIGENCE; CHLORINE COMPOUNDS; COMPUTATIONAL COMPLEXITY;

LINGUISTICS;

EID: 51849144561     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. Anton, H. 1994. Elementary Linear Algebra. Wiley & Sons, seventh edition.
2. Ausiello, G.; Crescenzi, P.; Gambosi, G.; Kann, V.; Marchetti-Spaccamela, A.; and Protasi, M. 1999. Complexity and Approximation. Springer-Verlag.
3. Chevaleyre, Y.; Endriss, U.; Estivie, S.; and Maudet, N. 2004. Multiagent resource allocation with k-additive utility functions. In Proc. DIMACS-LAMSADE Workshop on Computer Science and Decision Theory, Annales du LAMSADE 3, 83-100.
4. Chevaleyre, Y.; Endriss, U.; and Lang, J. 2006. Expressive power of weighted propositional formulas for cardinal preference modelling. In Proc. 10th Intl. Conference on Principles of Knowledge Representation and Reasoning (KR-2006), 145-152. AAAI Press.
5. Coste-Marquis, S.; Lang, J.; Liberatore, P.; and Marquis, P. 2004. Expressive power and succinctness of propositional languages for preference representation. In Proc. 9th Intl. Conference on Principles of Knowledge Representation and Reasoning (KR-2004), 203-212. AAAI Press.
6. Cramton, P.; Shoham, Y.; and Steinberg, R., eds. 2006. Combinatorial Auctions. MIT Press.
7. Garey, M., and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-completeness. W.H. Freeman and Co.
8. Grabisch, M. 1997. k-order additive discrete fuzzy measures and their representation. Fuzzy Sets and Systems 92:167-189.
9. Jaumard, B., and Simeone, B. 1987. On the complexity of the maximum satisfiability problem for Horn formulas. Information Processing Letters 26(1): 1-4.
10. Lang, J. 2004. Logical preference representation and combinatorial vote. Annals of Mathematics and Artificial Intelligence 42(1-3):37-71.
11. Lehmann, D.; Müller, R.; and Sandholm, T. 2006. The winner determination problem. In Cramton et al. (2006). 297-317.
12. Nisan, N. 2006. Bidding languages for combinatorial auctions. In Cramton et al. (2006). 215-232.
13. Pinkas, G. 1991. Propositional nonmonotonic reasoning and inconsistency in symmetric neural networks. In Proc. 12th Intl. Conference on Artificial Intelligence (IJCAI-1991). Morgan-Kaufmann Publishers.
14. Rota, G.-C. 1964. On the foundations of combinatorial theory I: Theory of Möbius functions. Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 2(4):340-368.
15. Sandholm, T., and Boutilier, C. 2006. Preference elicitation in combinatorial auctions. In Cramton et al. (2006). 233-263.