DocumentCode :
240242
Title :
Generalized game trees and their evaluation
Author :
Basbous, Raed ; Nagy, Benedek
Author_Institution :
Dept. of Appl. Math. & Comput. Sci., Eastern Mediterranean Univ., Famagusta, Cyprus
fYear :
2014
fDate :
5-7 Nov. 2014
Firstpage :
55
Lastpage :
60
Abstract :
Expression trees are well-known tools to visualize the syntactical structure of the expressions. They are helpful also in evaluation. Games and game theory form an important field in Artificial Intelligence and it has several connections to Business and Economy. Game trees are used to represent games. In this paper, some types of extensions of game trees are considered using operations, e.g., multiplication, (constrained) addition and the usual minimum and maximum. Evaluation techniques are presented, as well as, various pruning algorithms that can quicken the evaluation in several cases.
Keywords :
artificial intelligence; game theory; trees (mathematics); artificial intelligence; expression trees; game theory; generalized game trees; pruning algorithms; syntactical structure; Computer science; Conferences; Decision trees; Educational institutions; Game theory; Games; Nickel; alpha-beta pruning; cuts of trees; decision making; expression trees; game trees; minimax algorithm; shortcut evaluation;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Cognitive Infocommunications (CogInfoCom), 2014 5th IEEE Conference on
Conference_Location :
Vietri sul Mare
Type :
conf
DOI :
10.1109/CogInfoCom.2014.7020518
Filename :
7020518
Link To Document :
بازگشت