Multiagent Learning in Large Anonymous Games
From MaRDI portal
Recommendations
- Observational learning in large anonymous games
- scientific article; zbMATH DE number 1977944
- scientific article; zbMATH DE number 1927166
- Game-Theoretic Learning and Distributed Optimization in Memoryless Multi-Agent Systems
- A reinforcement learning scheme for a partially-observable multi-agent game
- A reinforcement learning scheme for a partially-observable multi-agent game
- Multi-agent inverse reinforcement learning for certain general-sum stochastic games
- Game-theoretic learning and distributed optimization in memoryless multi-agent system
- scientific article; zbMATH DE number 2086990
Cited in
(11)- Categorizing others in a large game
- Fault tolerance in large games
- Versatile uncertainty quantification of contrastive behaviors for modeling networked anagram games
- AWESOME: a general multiagent learning algorithm that converges in self-play and learns a best response against stationary opponents
- A general criterion and an algorithmic framework for learning in multi-agent systems
- Query complexity of approximate equilibria in anonymous games
- Best-reply dynamics in large binary-choice anonymous games
- Query complexity of approximate equilibria in anonymous games
- Socially-aware multiagent learning: towards socially optimal outcomes
- scientific article; zbMATH DE number 2243375 (Why is no real title available?)
- Best-response dynamics, playing sequences, and convergence to equilibrium in random games
This page was built for publication: Multiagent Learning in Large Anonymous Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2996911)
