Study on the Transformation From CP-nets to Game Theory

被引：0
|
作者：
Liu Zhaowei [1 ]
Liu Jinglei [1 ]
Sun Xuejiao [1 ]
机构：
[1] Yantai Univ, Yantai, Shandong, Peoples R China
来源：
COMPUTATIONAL MATERIALS SCIENCE, PTS 1-3 | 2011年 / 268-270卷
关键词：
CP-nets; game theory; optimal outcome; Nash equilibrium; transformation;
D O I：
10.4028/www.scientific.net/AMR.268-270.1750
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Researching preference is significative in artificial intelligence. The paper shows the concept and example of CP-nets on preference representation firstly. And then game theory with strategy preference is proposed. For the nature relation between CP-nets and game theory on preference, this paper attempts to transform the question of CP-nets to game theory on three points which is concept, model and essential question(optimal outcome and Nash equilibrium) and the proves are given on the heel. Finally, the future work on relation and equivalence of CP-nets and game theory is presented.
引用
收藏
页码：1750 / 1754
页数：5
相关论文
共 50 条
  • [21] Generating CP-Nets Uniformly at Random
    Allen, Thomas E.
    Goldsmith, Judy
    Justice, Hayden E.
    Mattei, Nicholas
    Raines, Kayla
    THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 872 - 878
  • [22] A Tool to Graphically Edit CP-Nets
    Shafran, Aidan
    Saarinen, Sam
    Goldsmith, Judy
    THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 4387 - 4388
  • [23] Learning Probabilistic CP-nets from Observations of Optimal Items
    Bigot, Damien
    Mengin, Jerome
    Zanuttini, Bruno
    STAIRS 2014, 2014, 264 : 81 - 90
  • [24] Learning CP-Nets Structure From Preference Data Streams
    Liu, Zhaowei
    Zhong, Zhaolin
    Zhang, Chenghui
    Yu, Yanwei
    Liu, Jinglei
    IEEE ACCESS, 2018, 6 : 56716 - 56726
  • [25] Optimal Decision Making with CP-nets and PCP-nets
    Sikdar, Sujoy
    Adali, Sibel
    Xia, Lirong
    AAMAS'17: PROCEEDINGS OF THE 16TH INTERNATIONAL CONFERENCE ON AUTONOMOUS AGENTS AND MULTIAGENT SYSTEMS, 2017, : 1736 - 1738
  • [26] On the hardness of bribery variants in voting with CP-nets
    Dorn, Britta
    Krueger, Dominikus
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2016, 77 (3-4) : 251 - 279
  • [27] The computational complexity of dominance and consistency in CP-nets
    Goldsmith, Judy
    Lang, Jerome
    Truszczynski, Miroslaw
    Wilson, Nic
    19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-05), 2005, : 144 - 149
  • [28] A Parameterized Complexity Analysis of Generalized CP-Nets
    Kronegger, Martin
    Lackner, Martin
    Pfandler, Andreas
    Pichler, Reinhard
    PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 1091 - 1097
  • [29] Semantic information retrieval based on CP-Nets
    Boubekeur, Fatiha
    Boughanem, Mohand
    Tamine-Lechani, Lynda
    2007 IEEE INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS, VOLS 1-4, 2007, : 809 - 815
  • [30] Rank Pruning for Dominance Queries in CP-Nets
    Laing, Kathryn
    Thwaites, Peter Adam
    Gosling, John Paul
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2019, 64 : 55 - 107
12345