A Game Tree Algorithm for Optimal Outcome of CP-nets

Zhaowei Liu; Xiangnan Li; Shaofang Guo; Jinglei Liu
March 2012
International Journal of Digital Content Technology & its Applic;Mar2012, Vol. 6 Issue 4, p173
Academic Journal
Preference handling is important for multi-agent system in artificial intelligence domain. The paper discusses the relations between the CP-nets and games, and the optimal questions of CP-nets by using of a Nash Tree algorithm of game theory. This paper describes some concepts and examples of preference at first, and then characters of CP-nets which is a tool for preference representation. For finding a solution to resolve the optimal outcome of CP-nets, strategy game is proposed. This paper establishes the relationship between CP-nets and strategy game in two aspects which includes model and essential question. On base of the relation, a Nash Tree algorithm is applied in CP-nets. Finally, the future work of optimal outcome for cyclic CP-nets is presented.


Related Articles

  • A Survey of artificial immune applications. Jieqiong Zheng; Yunfang Chen; Wei Zhang // Artificial Intelligence Review;Jun2010, Vol. 34 Issue 1, p19 

    The artificial immune system (AIS) community has been vibrant and active for a number of years now, producing a prolific amount of research ranging from modeling the natural immune system, to tackling real world applications, using an equally diverse set of immune inspired algorithms. We review...

  • Automation in construction scheduling: a review of the literature. Faghihi, Vahid; Nejat, Ali; Reinschmidt, Kenneth; Kang, Julian // International Journal of Advanced Manufacturing Technology;Dec2015, Vol. 81 Issue 9-12, p1845 

    Automating the development of construction schedules has been an interesting topic for researchers around the world for almost three decades. Researchers have approached solving scheduling problems with different tools and techniques. Whenever a new artificial intelligence or optimization tool...

  • Spectrum Allocation Based on Game Theory in Cognitive Radio Networks. Qiufen Ni; Rongbo Zhu; Zhenguo Wu; Yongli Sun; Lingyun Zhou; Bin Zhou // Journal of Networks;Mar2013, Vol. 8 Issue 3, p712 

    As a kind of intelligent communication technology, the characteristic of dynamic spectrum allocation of cognitive radio provides feasible scheme for sharing with the spectrum resources among the primary user and secondary users, which solves the current spectrum resource scarcity problem. In...

  • Study on Method of Robust Multidisciplinary Collaborative Decision for Product Design. Lijun Yan; Zongbin Li; Xiaoyang Yuan // Information Technology Journal;2009, Vol. 8 Issue 4, p441 

    A robust method for decentralized multidisciplinary collaborative decision was presented which adopts interval to describe the uncertainty of decision variables and non- cooperative game theory to model the relationship between design teams under decentralized decision environment. Considering...

  • Sequencing situations with Just-in-Time arrival, and related games. Lohmann, Edwin; Borm, Peter; Slikker, Marco // Mathematical Methods of Operations Research;Dec2014, Vol. 80 Issue 3, p285 

    In this paper sequencing situations with Just-in-Time (JiT) arrival are introduced. This new type of one-machine sequencing situations assumes that a job is available to be handled by the machine as soon as its predecessor is finished. A basic predecessor dependent set-up time is incorporated in...


    In this study, solution of course scheduling problems in student affairs automation used in the universities was carried out using Genetic Algorithm method which is one of Heuristic Optimization approaches. Scheduling problem is the process of placing the works to be done in time intervals at...

  • A Scheme for Combining SSA with HSA and its Application to an Uncapacitated SLLS Problem. Yi Han; Jianhu Cai; Ikou Kaku; Yanlai Li; Liping Zhao // Journal of Applied Sciences;2013, Vol. 13 Issue 14, p2752 

    Scatter Search Algorithm (SSA) and Harmony Search Algorithm (HS) are two metaheuristics proposed respectively in 1977 to solve discrete optimization problems and in 2001 for continuous optimization problems. Currently, both algorithms have been wildly adopted in many optimization fields. In this...

  • Cellular bat algorithm for 0-1 programming problem. LI Zhi-yong; MA Liang; ZHANG Hui-zhen // Application Research of Computers / Jisuanji Yingyong Yanjiu;Oct2013, Vol. 30 Issue 10, p2903 

    This paper proposed cellular bat algorithm to solve 0-1 programming problem, which was based on the principles of cellular automata and bat algorithm. It used cellular and its neighbor to enhance the diversity of the searching process to improve the ability of global optimization, and...

  • Speedup Learning for Repair-based Search by Identifying Redundant Steps. Markovitch, Shaul; Shatil, Asaf // Journal of Machine Learning Research;5/15/2004, Vol. 4 Issue 4, p649 

    Repair-based search algorithms start with an initial solution and attempt to improve it by iteratively applying repair operators. Such algorithms can often handle large-scale problems that may be difficult for systematic search algorithms. Nevertheless, the computational cost of solving such...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics