Existence of multiagent equilibria with limited agents

Journal of Artificial Intelligence Research

Volumn 22, Issue , 2004, Pages 353-384

  Bowling, Michael ^a   Veloso, Manuela ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; GAME THEORY; INTELLIGENT AGENTS; LEARNING ALGORITHMS; LEARNING SYSTEMS; SOFTWARE AGENTS;

AGENT BEHAVIOR; MULTIAGENT EQUILIBRIA; MULTIAGENT LEARNING ALGORITHM;

MULTI AGENT SYSTEMS;

EID: 27344450680     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1332     Document Type: Article

References (52)

1. Baxter, J., & Bartlett, P. L. (2000). Reinforcement learning in POMDP's via direct gradient ascent. In Proceedings of the Seventeenth International Conference on Machine Learning, pp. 41-48, Stanford University. Morgan Kaufman.
2. Bowling, M., & Veloso, M. (1999). Bounding the suboptimality of reusing subproblems. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 1340-1345, Stockholm, Sweden. Morgan Kaufman.
3. An earlier version appeared in the Proceedings of the NIPS Workshop on Abstraction in Reinforcement Learning, 1998.
4. Bowling, M., & Veloso, M. (2002). Multiagent learning using a variable learning rate. Artificial Intelligence, 136, 215-250.
5. Carmel, D. (1997). Model-based Learning of Interaction Strategies in Multi-agent Systems. Ph.D. thesis, Computer Science Department, Technion.
6. Carmel, D., & Markovitch, S. (1996). Learning models of intelligent agents. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, Menlo Park, CA. AAAI Press.
7. Claus, C., & Boutilier, C. (1998). The dynamics of reinforcement learning in cooperative multiagent systems. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, pp. 746-752, Menlo Park, CA. AAAI Press.
8. Filar, J., & Vrieze, K. (1997). Competitive Markov Decision Processes. Springer Verlag, New York.
9. Fink, A. M. (1964). Equilibrium in a stochastic n-person game. Journal of Science in Hiroshima University, Series A-I, 28, 89-93.
10. Gaughan, E. D. (1993). Introduction to Analysis, 4th Edition. Brooks/Cole Publishing Company, Pacific Grove, CA.
11. Gilboa, I., & Samet, D. (1989). Bounded versus unbounded rationality: The tyranny of the weak. Games and Economic Behavior, 213-221.
12. Gintis, H. (2000). Game Theory Evolving. Princeton University Press.
13. Greenwald, A., & Hall, K. (2002). Correlated Q-learning. In Proceedings of the AAAI Spring Symposium Workshop on Collaborative Learning Agents.
14. Hauskrecht, M., Meuleau, N., Kaelbling, L. P., Dean, T., & Boutilier, C. (1998). Hierarchical solution of Markov decision processes using macro-actions. In Proceedings of the Fourteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI-98).
15. Hu, J., & Wellman, M. P. (1998). Multiagent reinforcement learning: Theoretical framework and an algorithm. In Proceedings of the Fifteenth International Conference on Machine Learning, pp. 242-250, San Francisco. Morgan Kaufman.
16. Jaakkola, T., Singh, S. P., & Jordan, M. I. (1994). Reinforcement learning algorithm for partially observable Markov decision problems. In Advances in Neural Information Processing Systems 6. MIT Press.
17. Jansen, P. J. (1992). Using Knowledge About the Opponent in Game-tree Search. Ph.D. thesis, Computer Science Department, Carnegie Mellon University.
18. Kuhn, H. W. (1953). Extensive games and the problem of information. In Kuhn, H. W., & Tucker, A. W. (Eds.), Contributions to the Theory of Games II, pp. 193-216. Princeton University Press. Reprinted in (Kuhn, 1997).
19. Kuhn, H. W. (Ed.). (1997). Classics in Game Theory. Princeton University Press.
20. Larson, K., & Sandholm, T. (2001). Bargaining with limited computation: Deliberation equilibrium. Artificial Intelligence, 132(2), 183-217.
21. Littman, M. (2001). Friend-or-foe Q-learning in general-sum games. In Proceedings of the Eighteenth International Conference on Machine Learning, pp. 322-328. Morgan Kaufman.
22. Littman, M., & Stone, P. (2001). Leading best-response strategies in repeated games. In Seventeenth Annual International Joint Conference on Artificial Intelligence Workshop on Economic Agents, Models, and Mechanisms.
23. Littman, M. L. (1994). Markov games as a framework for multi-agent reinforcement learning. In Proceedings of the Eleventh International Conference on Machine Learning, pp. 157-163. Morgan Kaufman.
24. Littman, M. L., & Szepesvári, G. (1996). A generalized reinforcement-learning model: Convergence and applications. In Proceedings of the 13th International Conference on Machine Learning, pp. 310-318, Bari, Italy. Morgan Kaufmann.
25. Mahadevan, S. (1996). Average reward reinforcement learning: Foundations, algorithms, and empirical results. Machine Learning, 22, 159-196.
26. Mataric, M. J. (1994). Reward functions for accelerated learning. In Proceedings of the Eleventh International Conference on Machine Learning, San Francisco. Morgan Kaufman.
27. McGovern, A., & Barto, A. G. (2001). Automatic discovery of subgoals in reinforcement learning using diverse density. In Proceedings of the Eighteenth International Conference on Machine Learning, pp. 361-368. Morgan Kaufman.
28. Mertens, J. F., & Neyman, A. (1981). Stochastic games. International Journal of Game Theory, 10, 53-56.
29. Moore, A. W., & Atkeson, C. G. (1993). Prioritized sweeping: Reinforcement learning with less data and less time. Machine Learning, 13, 103-130.
30. Nash, Jr., J. F. (1950). Equilibrium points in n-person games. PNAS, 36, 48-49. Reprinted in (Kuhn, 1997).
31. Ng, A. Y., Parr, R., & Koller, D. (1999). Policy search via density estimation. In Advances in Neural Information Processing Systems 12, pp. 1022-1028. MIT Press.
32. Noda, I., Matsubara, H., Hiraki, K., & Frank, I. (1998). Soccer server: a tool for research on multi-agent systems. Applied Artificial Intelligence, 12, 233-250.
33. Osborne, M. J., & Rubinstein, A. (1994). A Course in Game Theory. The MIT Press.
34. Osborne, M. J., & Rubinstein, A. (1997). Games with procedurally rational players. Working papers 9702, McMaster University, Department of Economics.
35. Riley, P., & Veloso, M. (2000). On Behavior Classification in Adversarial Environments, pp. 371-380. Springer-Verlag.
36. Riley, P., & Veloso, M. (2002). Planning for distributed execution through use of probabilistic opponent models. In Proceedings of the Sixth International Conference on AI Planning and Scheduling, Toulouse, France.
37. Robinson, J. (1951). An iterative method of solving a game. Annals of Mathematics, 54, 296-301. Reprinted in (Kuhn, 1997).
38. Rosen, J. B. (1965). Existence and uniqueness of equilibrium points for concave n-person games. Econometrica, 33, 520-534.
39. Rubinstein, A. (1998). Modeling Bounded Rationality. The MIT Press.
40. Sen, S., Sekaran, M., & Hale, J. (1994). Learning to coordinate without sharing information. In Proceedings of the 13th National Conference on Artificial Intelligence.
41. Shapley, L. S. (1953). Stochastic games. PNAS, 39, 1095-1100. Reprinted in (Kuhn, 1997).
42. Simon, H. A. (1976). From substantive to procedural rationality. In Latis, S. J. (Ed.), Methods and Appraisals in Economics, pp. 129-148. Cambridge University Press, New York.
43. Simon, H. A. (1982). Models of Bounded Rationality. MIT Press, Cambridge, MA.
44. Singh, S., Jaakkola, T., Littman, M. L., & Szepesvári, C. (2000). Convergence results for single-step on-policy reinforcement-learning algorithms. Machine Learning.
45. Sutton, R. S., McAllester, D., Singh, S., & Mansour, Y. (2000). Policy gradient methods for reinforcement learning with function approximation. In Advances in Neural Information Processing Systems 12, pp. 1057-1063. MIT Press.
46. Sutton, R. S., Precup, D., & Singh, S. (1998). Intra-option learning about temporally abstract actions. In Proceedings of the Fifteenth International Conference on Machine Learning, pp. 556-564, San Francisco. Morgan Kaufman.
47. Tan, M. (1993). Multi-agent reinforcement learning: Independent vs. cooperative agents. In Proceedings of the Tenth International Conference on Machine Learning, pp. 330-337, Amherst, MA.
48. Uther, W., & Veloso, M. (1997). Adversarial reinforcement learning. Tech. rep., Carnegie Mellon University. Unpublished.
49. Uther, W. T. B. (2002). Tree Based Hierarchical Reinforcement Learning. Ph.D. thesis, Computer Science Department, Carnegie Mellon University, Pittsburgh, PA. Available as technical report CMU-CS-02-169.
50. Vrieze, O. J. (1987). Stochastic Games with Finite State and Action Spaces. No. 33 in CWI Tracts. Centrum voor Wiskunde en Informatica.
51. Watkins, C. J. C. H. (1989). Learning from Delayed Rewards. Ph.D. thesis, King's College, Cambridge, UK.
52. Williams, R. J., & Baird, L. C. (1993). Tight performance bounds on greedy policies based on imperfect value functions. Technical report, College of Computer Science, Northeastern University.