Learning efficient Nash equilibria in distributed systems
From MaRDI portal
(Redirected from Publication:423765)
Recommendations
Cites work
- scientific article; zbMATH DE number 6469241 (Why is no real title available?)
- Achieving Pareto Optimality Through Distributed Learning
- Algorithms, games, and the internet
- Average testing and Pareto efficiency
- Distributed Random Access Algorithm: Scheduling and Congestion Control
- Evolutionary Implementation and Congestion Pricing
- Evolving aspirations and cooperation
- Global Nash convergence of Foster and Young's regret testing
- How long to equilibrium? The communication complexity of uncoupled equilibrium procedures
- How noise matters.
- Joint Strategy Fictitious Play With Inertia for Potential Games
- Learning by trial and error
- Learning, Mutation, and Long Run Equilibria in Games
- Learning, hypothesis testing, and Nash equilibrium.
- Multi-agent learning for engineers
- Multiagent learning using a variable learning rate
- Payoff-based dynamics for multiplayer weakly acyclic games
- Regret-based continuous-time dynamics.
- Revisiting log-linear learning: asynchrony, completeness and payoff-based implementation
- Stochastic uncoupled dynamics and Nash equilibrium
- The Evolution of Conventions
- The statistical mechanics of best-response strategy revision
- The statistical mechanics of strategic interaction
- Uncoupled automata and pure Nash equilibria
Cited in
(26)- Evolutionary dynamics and equitable core selection in assignment games
- Verified learning without regret. From algorithmic game theory to distributed systems with mechanized complexity guarantees
- A behavioral study of ``noise in coordination games
- A distributed Tikhonov-regularization algorithm for optimal Nash equilibrium computation in aggregative games
- Agency, potential and contagion
- The evolution of conventions under condition-dependent mistakes
- The price of anarchy and stability in general noisy best-response dynamics
- Achieving Pareto Optimality Through Distributed Learning
- Learning efficient equilibria in repeated games
- Conventional contracts, intentional behavior and logit choice: equality without symmetry
- Game-Theoretic Learning and Distributed Optimization in Memoryless Multi-Agent Systems
- Distributed learning in congested environments with partial information
- Robust networked multiagent optimization: designing agents to repair their own utility functions
- Game of thrones: fully distributed learning for multiplayer bandits
- Core stability and core selection in a decentralized labor matching market
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
- Revisiting log-linear learning: asynchrony, completeness and payoff-based implementation
- Learning to play efficient coarse correlated equilibria
- State based potential games
- Learning equilibria of a stochastic game on Gaussian interference channels with incomplete information
- Selecting efficient correlated equilibria through distributed learning
- On the empirical relevance of correlated equilibrium
- A strategic learning algorithm for state-based games
- Robust wake steering control design in a wind farm for power optimisation using adaptive learning game theory (ALGT) method
- Evolutionary game theory: a renaissance
- Logit-Q dynamics for efficient learning in stochastic teams
This page was built for publication: Learning efficient Nash equilibria in distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423765)
