메뉴 건너뛰기




Volumn 2, Issue , 2008, Pages 1037-1042

Preference aggregation with graphical utility models

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BIONICS; DECISION THEORY; GRAPHIC METHODS;

EID: 57749191227     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (18)

References (20)
  • 1
    • 0002546896 scopus 로고
    • Graphical models for preference and utility
    • Bacchus, F., and Grove, A. 1995. Graphical models for preference and utility. In UAI'95.
    • (1995) UAI , vol.95
    • Bacchus, F.1    Grove, A.2
  • 2
    • 0003288280 scopus 로고    scopus 로고
    • UCP-networks; a directed graphical representation of conditional utilities
    • Boutilier, C.; Bacchus, F.; and Brafman, R. 2001. UCP-networks; a directed graphical representation of conditional utilities. In UAI'01.
    • (2001) UAI , vol.1
    • Boutilier, C.1    Bacchus, F.2    Brafman, R.3
  • 3
    • 4344559610 scopus 로고    scopus 로고
    • CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements
    • Boutilier, C.; Brafman, R.; Domshlak, C.; Hoos, H.; and Poole, D. 2004a. CP-nets: A tool for representing and reasoning with conditional ceteris paribus preference statements. J. of Artificial Intelligence Research 21:135-191.
    • (2004) J. of Artificial Intelligence Research , vol.21 , pp. 135-191
    • Boutilier, C.1    Brafman, R.2    Domshlak, C.3    Hoos, H.4    Poole, D.5
  • 4
    • 2442668142 scopus 로고    scopus 로고
    • Boutilier, C.; Brafman, R.; Domshlak, C.; Hoos, H.; and Poole, D. 2004b. Preference-based constraint optimization with CP-nets. Computational Intelligence 20.
    • Boutilier, C.; Brafman, R.; Domshlak, C.; Hoos, H.; and Poole, D. 2004b. Preference-based constraint optimization with CP-nets. Computational Intelligence 20.
  • 5
    • 47949093534 scopus 로고    scopus 로고
    • On generalized additive value-function decomposition
    • Brafman, R.; Domshlak, C.; and Kogan, T. 2004. On generalized additive value-function decomposition. In UAI'04.
    • (2004) UAI , vol.4
    • Brafman, R.1    Domshlak, C.2    Kogan, T.3
  • 6
    • 38349131195 scopus 로고    scopus 로고
    • Local utility elicitation in GAI models
    • Braziunas, D., and Boutilier, C. 2005. Local utility elicitation in GAI models. In UAI'05.
    • (2005) UAI , vol.5
    • Braziunas, D.1    Boutilier, C.2
  • 7
    • 84860581384 scopus 로고    scopus 로고
    • Expressive power of weighted propositional formulas for cardinal preference modeling
    • Chevaleyre, Y.; Endriss, U.; and Lang, J. 2007. Expressive power of weighted propositional formulas for cardinal preference modeling. In Proceedings of KR'07, 145-152.
    • (2007) Proceedings of KR'07 , pp. 145-152
    • Chevaleyre, Y.1    Endriss, U.2    Lang, J.3
  • 9
    • 0001189753 scopus 로고
    • Continuity properties of Paretian utility
    • Debreu, G. 1964. Continuity properties of Paretian utility. International Economic Review 5:285-293.
    • (1964) International Economic Review , vol.5 , pp. 285-293
    • Debreu, G.1
  • 10
    • 36448930877 scopus 로고    scopus 로고
    • Generalized value decomposition and structured multiattribute auctions
    • Engel, Y., and Wellman, M. P. 2007. Generalized value decomposition and structured multiattribute auctions. In EC'07, 227-236.
    • (2007) EC'07 , pp. 227-236
    • Engel, Y.1    Wellman, M.P.2
  • 12
    • 38349088487 scopus 로고    scopus 로고
    • GAI networks for utility elicitation
    • Gonzales, C., and Perny, P. 2004. GAI networks for utility elicitation. In KR'04, 224-234.
    • (2004) KR'04 , pp. 224-234
    • Gonzales, C.1    Perny, P.2
  • 16
    • 0006776658 scopus 로고    scopus 로고
    • An efficient algorithm for finding the M most probable configurations in probabilistic expert systems
    • Nilsson, D. 1998. An efficient algorithm for finding the M most probable configurations in probabilistic expert systems. Statistics and Computing 8(2): 159-173.
    • (1998) Statistics and Computing , vol.8 , Issue.2 , pp. 159-173
    • Nilsson, D.1
  • 17
    • 32144456036 scopus 로고    scopus 로고
    • Pini, M. S.; Rossi, F.; Venable, K. B.; and Walsh, T. 2005. Aggregating partially ordered preferences: Impossibility and possibility results. TARK 10.
    • Pini, M. S.; Rossi, F.; Venable, K. B.; and Walsh, T. 2005. Aggregating partially ordered preferences: Impossibility and possibility results. TARK 10.
  • 18
    • 9444252841 scopus 로고    scopus 로고
    • Representing and reasoning with preferences of multiple agents
    • mCP nets
    • Rossi, F.; Venable, K. B.; and Walsh, T. 2004. mCP nets: Representing and reasoning with preferences of multiple agents. In AAAI'04, 729-734.
    • (2004) AAAI'04 , pp. 729-734
    • Rossi, F.1    Venable, K.B.2    Walsh, T.3
  • 19
    • 0020802768 scopus 로고
    • An interactive weighted Tchebycheff procedure for multiple objective programming
    • Steuer, R., and Choo, E.-U. 1983. An interactive weighted Tchebycheff procedure for multiple objective programming. Mathematical Programming 26:326-344.
    • (1983) Mathematical Programming , vol.26 , pp. 326-344
    • Steuer, R.1    Choo, E.-U.2
  • 20
    • 0008156910 scopus 로고
    • On the completeness and constructiveness of parametric characterizations to vector optimization problems
    • Wierzbicki, A. 1986. On the completeness and constructiveness of parametric characterizations to vector optimization problems. OR Spektrum 8:73-87.
    • (1986) OR Spektrum , vol.8 , pp. 73-87
    • Wierzbicki, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.