Distributed learning in congested environments with partial information
From MaRDI portal
Recommendations
- Game of thrones: fully distributed learning for multiplayer bandits
- Decentralized Resource Allocation in Dynamic Networks of Agents
- Achieving Pareto Optimality Through Distributed Learning
- Decentralized anti-coordination through multi-agent learning
- A distributed ADMM-like method for resource sharing over time-varying networks
Cites work
- A class of games possessing pure-strategy Nash equilibria
- Achieving Pareto Optimality Through Distributed Learning
- Asymptotically efficient adaptive allocation rules
- Chernoff-Hoeffding bounds for Markov chains: generalized and simplified
- Congestion games with player-specific payoff functions
- Decentralized Heterogeneous Multi-Player Multi-Armed Bandits With Non-Zero Rewards on Collisions
- Decentralized Learning for Multiplayer Multiarmed Bandits
- Distributed learning for optimal spectrum access in dense device-to-device ad-hoc networks
- Fully Distributed Optimal Channel Assignment for Open Spectrum Access
- Game Theoretic Dynamic Channel Allocation for Frequency-Selective Interference Channels
- High-dimensional statistics. A non-asymptotic viewpoint
- scientific article; zbMATH DE number 3257031 (Why is no real title available?)
- Learning efficient Nash equilibria in distributed systems
- Multi-player bandits revisited
- Multi-player bandits: the adversarial case
- Potential games
- Worst-case equilibria
This page was built for publication: Distributed learning in congested environments with partial information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6605962)
