Distributed learning in congested environments with partial information

DOI10.1016/j.automatica.2024.111817zbMath1544.91036MaRDI QIDQ6605962

Tomer Boyarski, Vikram Krishnamurthy, Amir Leshem

Publication date: 16 September 2024

Published in: Automatica (Search for Journal in Brave)

zbMATH Keywords

congestion gameslearning in gamesdistributed learninglearning in dense environmentspoly-logarithmic regret

Mathematics Subject Classification ID

Rationality and learning in game theory (91A26) Potential and congestion games (91A14)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Learning efficient Nash equilibria in distributed systems
• Asymptotically efficient adaptive allocation rules
• Potential games
• Congestion games with player-specific payoff functions
• A class of games possessing pure-strategy Nash equilibria
• Chernoff-Hoeffding Bounds for Markov Chains: Generalized and Simplified
• Decentralized Learning for Multiplayer Multiarmed Bandits
• Fully Distributed Optimal Channel Assignment for Open Spectrum Access
• Game Theoretic Dynamic Channel Allocation for Frequency-Selective Interference Channels
• High-Dimensional Statistics
• Decentralized Heterogeneous Multi-Player Multi-Armed Bandits With Non-Zero Rewards on Collisions
• Achieving Pareto Optimality Through Distributed Learning
• Distributed learning for optimal spectrum access in dense device-to-device ad-hoc networks

This page was built for publication: Distributed learning in congested environments with partial information