|
Volumn 121, Issue 1, 2000, Pages 31-47
|
Near-optimal polynomial time algorithm for learning in certain classes of stochastic games
|
Author keywords
[No Author keywords available]
|
Indexed keywords
DECISION THEORY;
GAME THEORY;
LEARNING ALGORITHMS;
LEARNING SYSTEMS;
MARKOV PROCESSES;
POLYNOMIALS;
MULTI-AGENT SYSTEMS;
POLYNOMIAL TIME LEARNING SYSTEMS;
STOCHASTIC GAMES;
ARTIFICIAL INTELLIGENCE;
|
EID: 0034247018
PISSN: 00043702
EISSN: None
Source Type: Journal
DOI: 10.1016/S0004-3702(00)00039-4 Document Type: Article |
Times cited : (31)
|
References (10)
|