How to explore your opponent's strategy (almost) optimally

Proceedings - International Conference on Multi Agent Systems, ICMAS 1998

Volumn , Issue , 1998, Pages 64-71

  Carmel, David ^a   Markovitch, Shad ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EXPECTED UTILITY; EXPLORATION METHODS; EXPLORATION STRATEGIES; ITERATED PRISONER'S DILEMMA; LEARNING METHODS; MODEL-BASED OPC; MODELING-BASED LEARNING; OPPONENT MODELING;

MULTI AGENT SYSTEMS;

EID: 0011717041     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICMAS.1998.699033     Document Type: Conference Paper

References (14)

1. R. Axelrod. The Evolution of Cooperation. Basic Books, New York, 1984.
2. E. Ben-Porath. The complexity of computing a best response automaton in repeated games with mixed strategies. Games and Economic Behavior, 2:1-12, 1990.
3. D. Carmel and S. Markovitch. Exploration and adaptation in multi-agent systems: A model-based approach. In Proceedings of the fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), pages 606-611, Nagoya, Japan, Aug. 1997.
4. D. Carmel and S. Markovitch. Exploration strategies for model-based learning in multi-agent systems. Technical Report CIS9713, Technion, November 1997.
5. D. Carmel and S. Markovitch. Model-based learning of interaction strategies in multi-agent systems. Journal of experimental and theoretical Artificial Intelligence (JETAI) (to appear), 1997.
6. D. A. Cohn. Neural network exploration using optimal experimental design. In J. D. Cowan, G. Tesauro, and J. Alspector, editors, Advances in Neural Information Processing Systems 6, pages 679-686. Morgan Caufmann, 1994.
7. V. Fedorov. Theory of optimal experiments. New-york: Academic Press, 1972.
8. Y. Freund, M. Kearns, Y. Mansour, D. Ron, R. Rubinfeled, and R. E. Schapire. Efficient algorithms for learning to play repeated games against computationally bounded adversaries. In Proceedings of the Annual Symposium on the Foundations of Computer Science, pages 332-341,1995.
9. I. Gilboa. The complexity of computing best response Automata in repeated games. Journal of economic theory, 45:342-352,1988.
10. I. Gilboa and D. Samet. Bounded versus unbounded rationality: The tyranny of the weak. Games and Economic Behavior, 1:213-221,1989.
11. G. I. Karakoulas. Probabilistic exploration in planning while learning. In Proceedings of the 11th Conference on uncertainty in Artificial Intelligence (UAI 95), pages 352-361, July 1995.
12. A Rubinstein. Finite automata play the repeated Prisoner's Dilemma. Journal of Economic Theory, 39:83-96,1986.
13. T. W. Sandholm and R. H. Crites. Multiagent reinforcement learning and the iterated Prisoner's Dilemma. Biosystems Journal, 37:147-166,1995.
14. S. B. Thrun. The role of exploration in learning control. In D. A. White and D. Sopfge, editors, Handbookfor Intelligent Control. Multiscience Press Inc., 1992.