by Michael Kearns, Michael L. Littman, Satinder Singh
http://www.cs.colorado.edu/users/baveja/./Papers/graphgames.ps.gz
Add To MetaCart
Abstract:
We introduce a compact graph-theoretic representation for multi-party game theory. Our main result is a provably correct and efficient algorithm for computing approximate Nash equilibria in one-stage games represented by trees or sparse graphs. 1
Citations
|
2005
|
The Design and Analysis of Computer Algorithms
– Aho, Hopcroft, et al.
- 1974
|
|
1877
|
Artificial Intelligence: A Modern Approach
– Russell, Norvig
- 2002
|
|
402
|
Learning to act using real-time dynamic programming
– Barto, Bradtke, et al.
- 1995
|
|
397
|
Reinforcement Learning
– Sutton, Barto
- 1998
|
|
342
|
Non-cooperative games
– Nash
- 1951
|
|
294
|
Real-time heuristic search
– Korf
- 1990
|
|
188
|
Tractable inference for complex stochastic processes
– Boyen, Koller
- 1998
|
|
187
|
Exploiting structure in policy construction
– Boutilier, Dearden, et al.
- 1995
|
|
122
|
A robust and fast action selection mechanism for planning
– Bonet, Loerincs, et al.
- 1997
|
|
79
|
Nash and correlated equilibria: Some complexity considerations, Games and Economic Behavior 1:80–93
– Gilboa, Zemel
- 1989
|
|
78
|
Computation of Equilibria in Finite Games
– McKelvey, McLennan
- 1996
|
|
74
|
Multi-agent influence diagrams for representing and solving games
– Koller, Milch
|
|
69
|
Approximate planning in large POMDPs via reusable trajectories. (extended version of paper
– Kearns, Mansour, et al.
- 1999
|
|
64
|
Computing factored value functions for policies in structured MDPs
– Koller, Parr
- 1999
|
|
42
|
R.C.: An upper bound on the loss from approximate optimal-value functions. Machine Learning 16(3
– Singh, Yee
- 1994
|
|
26
|
Finite-sample convergence rates for Q-learning and indirect algorithms
– Kearns, Singh
- 1999
|
|
25
|
Approximate Planning for Factored POMDPs using Belief State Simplification. UAI-99
– McAllester, Singh
- 1999
|
|
24
|
Solving robot navigation problems with initial pose uncertainty using real-time heuristic search
– Koenig, Simmons
- 1998
|
|
22
|
Game networks
– Mura, P
- 2000
|
|
22
|
Integrating planning and execution in stochastic domains
– Dearden, Boutilier
- 1994
|
|
5
|
Applying online-search to reinforcement learning
– Davies, Ng, et al.
- 1998
|
