Evolutionary tournament-based comparison of learning and non-learning algorithms for iterated games

JASSS

Volumn 10, Issue 3, 2007, Pages

  Airiau, Stéphane ^a   Saha, Sabyasachi ^a   Sen, Sandip ^a  

^a NONE

Author keywords

Evolution; Repeated games; Simulation

Indexed keywords

EID: 34547255414     PISSN: 14607425     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (25)

1. AXELROD R (1985) The Evolution of Cooperation, Basic Books, New York.
2. AXELROD R (1987) The Evolution of Strategies in the Iterated Prisoner's Dilemma. In Genetic Algorithms and Simulated Annealing, Lawrence Davis (ed.) (London: Pitman, and Los Altos, CA: Morgan Kaufman, 1987), pp. 32-41.
3. Reprinted as Evolving New Strategies, pp. 10-39. in Axelrod, R. M. (1997).
4. BANERJEE B, Sen S and Peng J (2001) Fast concurrent reinforcement learners. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 825-830.
5. BANERJEE D and Sen S (2007) Reaching pareto-optimality in prisoner's dilemma using conditional Joint action learning. In Autonomous Agents and Multi-Agent Systems, Volume 15, number 1, August 2007, 91-108, Springer Netherlands
6. BOWLING M (2005) Convergence and no-regret in multiagent learning. In Advances in Neural Information Processing Systems 17, 209-216
7. BOWLING M and Veloso M (2001) Rational and convergent learning in stochastic games. In Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 1021-1026.
8. BOWLING M and Veloso M (2002) Multiagent learning using a variable learning rate. Artificial Intelligence, 136:215-250.
9. BRAMS S J (1994) Theory of Moves. Cambridge University Press, Cambridge: UK.
10. CLAUS C and Boutilier C (1998) The dynamics of reinforcement learning in cooperative multiagent systems. In Proceedings of the Fifteenth National Conference on Artificial Intelligence, 746-752. Menlo Park, CA: AAAI Press/MIT Press.
11. CONITZER V and Sandholm T (2003) Complexity results about Nash equilibria. In Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence (IJCAI), 2003.
12. CRANDALL J W and Goodrich M A (2005) Learning to Compete, Compromise, and Cooperate in Repeated General-Sum Games. In Proceedings of the 22nd International Conference on Machine Learning, 161-168.
13. DEB K and Goldberg D (1991) A comparative analysis of selection schemes used in genetic algorithms. In Rawlins, G. J., ed., Foundations of Genetic Algorithms, 69-93. San Mateo, CA: Morgan Kaufman.
14. NUDELMAN E, Wortman J, Shoham Y and Leyton-Brown K (2004) Run the GAMUT: A Comprehensive Approach to Evaluating Game-Theoretic Algorithms. In Proceedings of the third International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'04).
15. FUDENBERG D and Levine K (1998) The Theory of Learning in Games. Cambridge, MA: MIT Press.
16. GREENWALD A and Hall K (2003) Correlated-q learning. In Proceedings of the Twentieth International Conference on Machine Learning, pages 242-249.
17. HU J and Wellman M P (1998) Multiagent reinforcement learning: Theoretical framework and an algorithm. In Shavlik, J., ed., Proceedings of the Fifteenth International Conference on Machine Learning, 242-250. San Francisco, CA: Morgan Kaufmann.
18. JAFARI A, Greenwald A, Gondek D and Ercal G (2001) On no-regret learning, fictitious play and Nash equilibrium. In Proceedings of the Eighteenth International Conference on Machine Learning, 226-233, San Francisco, CA: Morgan Kaufmann.
19. LITTMAN M L and Stone P (2001) Implicit negotiation in repeated games. In Intelligent Agents VIII: AGENT THEORIES, ARCHITECTURE, AND LANGUAGES, 393-404.
20. Littman, M. L. 1994. Markov games as a framework for multi-agent reinforcement learning. In Proceedings of the Eleventh International Conference on Machine Learning, 157-163. San Mateo, CA: Morgan Kaufmann.
21. LITTMAN M L (1994) Markov games as a framework for multi-agent reinforcement learning. In Proceedings of the Seventh International Conference on Machine Learning, 157-163.
22. LITTMAN M L (2001) Friend-or-foe q-learnlng in generalsum games. In Proceedings of the Eighteenth International Conference on Machine Learning, 322-328. San Francisco, CA: Morgan Kaufmann.
23. MCKELVEY R D, McLennan A M, and Turocy T L (2005) Gambit: Software Tools for Game Theory, Version 0.2005.06.13. http://econweb.tamu.edu/gambit
24. MUNDHE M and Sen S (2000) Evaluating concurrent reinforcement learners. In Proceedings of Fourth International Conference on MultiAgent Systems, 421-422. Los Alamitos, CA: IEEE Computer Society.
25. SANDHOLM T and Crites R (1995) Multiagent Reinforcement Learning in the Iterated Prisoner's Dilemma. In Biosystems 37(1:2).