DocumentCode
2387707
Title
SRML Learning Game Theory with Application to Internet Security and Management Systems
Author
Huang, James Kuodo ; Chen, Bang-Su
Author_Institution
California Inf. Technol., Alhambra
fYear
2007
fDate
2-4 Nov. 2007
Firstpage
584
Lastpage
584
Abstract
On May 8, 1997 IBM´s Deep Blue computer chess program had beaten chess grand master G. Kasparov in New York. On August 10, 2006 computer Chinese chess systems had also beaten grand masters marginally in Beijing. Both types of chess game systems are planned searching expert computer systems without machine learning capability. However computer GO game systems are still far behind human GO masters´s capability. Therefore a machine learning game theory could be still important research in game theory. In this article a SRM machine learning game theory is introduced. The application of our game theory to Internet security, computer security, GO games, robotics, and management systems will be investigated. The general application of our game theory to business, economics, engineering, social science, and other related fields are also discussed.
Keywords
Internet; computer games; game theory; learning (artificial intelligence); robots; security of data; GO games; Internet security; computer security; game theory; management systems; robotics; self reproducing machine learning; Application software; Books; Computer security; Game theory; Humans; Internet; Learning systems; Machine learning; Robots; Systems engineering and theory;
fLanguage
English
Publisher
ieee
Conference_Titel
Granular Computing, 2007. GRC 2007. IEEE International Conference on
Conference_Location
Fremont, CA
Print_ISBN
978-0-7695-3032-1
Type
conf
DOI
10.1109/GrC.2007.157
Filename
4403167
Link To Document