Model-based learning of interaction strategies in multi-agent systems

DOI10.1080/095281398146789zbMath1053.68591OpenAlexW2006198267MaRDI QIDQ4421289

David Carmel, Shaul Markovitch

Publication date: 1998

Published in: Journal of Experimental & Theoretical Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/095281398146789

zbMATH Keywords

multi-agent systemmodel-based learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Theory of software (68N99)

Related Items (5)

Autonomous agents modelling other agents: a comprehensive survey and open problems ⋮ Learning Grammars and Automata with Queries ⋮ Learning to bid in bridge ⋮ Recall searching with and without recall ⋮ A unifying learning framework for building artificial game-playing agents

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite automata play the repeated prisoner's dilemma
• Learning regular sets from queries and counterexamples
• On players with a bounded number of states
• The complexity of computing a best response automaton in repeated games with mixed strategies
• Bounded versus unbounded rationality: The tyranny of the weak
• Learning to take actions
• Computable strategies for repeated prisoner's dilemma
• \({\mathcal Q}\)-learning
• Adaption and learning in multi-agent systems. IJCAI '95 workshop, Montréal, Canada, August 21, 1995. Proceedings
• Inference of finite automata using homing sequences
• Optimality and domination in repeated games with bounded players
• The Evolution of Cooperation
• The Complexity of Markov Decision Processes
• The Structure of Nash Equilibrium in Repeated Games with Finite Automata
• Complexity of automaton identification from given data
• On the complexity of minimum inference of regular sets
• Efficient learning of typical finite automata from random walks

This page was built for publication: Model-based learning of interaction strategies in multi-agent systems