Learning conditionally lexicographic preference relations

Frontiers in Artificial Intelligence and Applications

Volumn 215, Issue , 2010, Pages 269-274

  Booth, Richard ^a   Chevaleyre, Yann ^b   Lang, Jérôme ^b   Mengin, Jérôme ^c   Sombattheera, Chattrakul ^d  

^a UNIVERSITY OF LUXEMBOURG   (Luxembourg)

^b Centre National de la Recherche Scientifique   (France)

^c UNIVERSITÉ DE TOULOUSE   (France)

^d MAHASARAKHAM UNIVERSITY   (Thailand)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION COMPLEXITY; GRAPHICAL REPRESENTATIONS; LEXICOGRAPHIC PREFERENCES; MULTI-ATTRIBUTES; ORDINAL PREFERENCE; PREFERENCE ELICITATION; PREFERENCE RELATION;

ARTIFICIAL INTELLIGENCE;

EID: 77956033200     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: 10.3233/978-1-60750-606-5-269     Document Type: Conference Paper

References (7)

1. Dimopoulos, Y., Michael, L., & Athienitou, F. 2009. Ceteris Paribus Preference Elicitation with Predictive Guarantees. Proc. IJCAI'09, pp 1890-1895.
2. Dombi, J., Imreh, C., & Vincze, N. 2007. Learning Lexicographic Orders. European J. of Operational Research, 183, pp 748-756.
3. Koriche, F., & Zanuttini, B. 2009. Learning conditional preference networks with queries, Proc. IJCAI'09, pp 1930-1935.
4. Lang, J., & Mengin, J. 2009. The complexity of learning separable ceteris paribus preferences. Proc. IJCAI'09, pages 848-853.
5. Schmitt, M., & Martignon, L. 2006. On the Complexity of Learning Lexicographic Strategies. J. of Mach. Learning Res., 7, pp 55-83.
6. Wilson, N. 2006. An Efficient Upper Approximation for Conditional Preference. In Proc. ECAI 2006, pp 472-476.
7. Yaman, F., Walsh, T., Littman, M., & desJardins, M., 2008. Democratic Approximation of Lexicographic Preference Models. In: Proc. ICML'08, pp 1200-1207.