2007 · 11 citations · 7 references
ComputingComputer ScienceStrategyArtificial IntelligenceData MiningGame TheoryAlgorithmic Game TheoryBehavioral Game TheoryDynamic GamesGame PlayingMulti-agent SystemsArtificial Intelligence In GamesComputational Game TheoryDeterministic Finite AutomataGame-playing AgentsGame-theoretic LearningGame-theoretic Multi-agent SystemsPolynomial Time ComplexityStrategy Learning
Abstract: Soccer simulation is an effort to motivate researchers to perform artificial and robotic intelligence investigations in a multi-agent system framework. In this paper, we propose a game theoric-based data mining approach to help the coach agent select the best strategy for each soccer player agent in order to gain the most probable payoffs.These payoffs are calculated both static and dynamic i.e. are taken from experience results that are stored in a knowledge-base or is learned knowledge during the game. In this work we have confined ourselves to a model in which opponent strategy remains static. We take advantage of a learning algorithm with a polynomial time complexity in the number of states of the opponent strategy modeled by deterministic finite automata. 1
7
David J. Hand, Heikki Mannila, Padhraic Smyth · 2001 · 2.4K citations
Finite automata play the repeated prisoner's dilemma
Ariel Rubinstein · Journal of Economic Theory · 1986 · 607 citations
RoboCup: A Challenge Problem for AI
Hiroaki Kitano, Minoru Asada, Yasuo Kuniyoshi et al. · AI Magazine · 1997 · 424 citations