Copertina

Polynomial Convergence of Bandit No-Regret Dynamics in Congestion Games

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Dadi, Leello, Panageas, Ioannis, Skoulakis, Stratis, Viano, Luca, Cevher, Volkan
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Computer Science and Game Theory
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Continuous-Time Analysis of Heavy Ball Momentum in Min-Max Games
di: Feng, Yi, et al.
Pubblicazione: (2025)

Optimism Without Regularization: Constant Regret in Zero-Sum Games
di: Lazarsfeld, John, et al.
Pubblicazione: (2025)

Rethinking Pricing in Energy Markets: Pay-as-Bid vs Pay-as-Clear
di: Caragiannis, Ioannis, et al.
Pubblicazione: (2025)

Revenue Guarantees in Autobidding Platforms
di: Caragiannis, Ioannis, et al.
Pubblicazione: (2026)

Convergence of Regret Matching in Potential Games and Constrained Optimization
di: Anagnostides, Ioannis, et al.
Pubblicazione: (2025)

Efficient Kernelized Learning in Polyhedral Games Beyond Full-Information: From Colonel Blotto to Congestion Games
di: Kontogiannis, Andreas, et al.
Pubblicazione: (2025)

Last-Iterate Convergence: Zero-Sum Games and Constrained Min-Max Optimization
di: Daskalakis, Constantinos, et al.
Pubblicazione: (2018)

Efficient Continual Finite-Sum Minimization
di: Mavrothalassitis, Ioannis, et al.
Pubblicazione: (2024)

Global Convergence of Multi-Agent Policy Gradient in Markov Potential Games
di: Leonardos, Stefanos, et al.
Pubblicazione: (2021)

The Welfare Gap of Strategic Storage: Universal Bounds and Price Non-Linearity
di: Jiang, Zhile, et al.
Pubblicazione: (2026)

(Doubly) Exponential Lower Bounds for Follow the Regularized Leader in Potential Games
di: Anagnostides, Ioannis, et al.
Pubblicazione: (2026)

Last-iterate Convergence Separation between Extra-gradient and Optimism in Constrained Periodic Games
di: Feng, Yi, et al.
Pubblicazione: (2024)

Learning Equilibria in Adversarial Team Markov Games: A Nonconvex-Hidden-Concave Min-Max Optimization Problem
di: Kalogiannis, Fivos, et al.
Pubblicazione: (2024)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
di: Anagnostides, Ioannis, et al.
Pubblicazione: (2025)

Imitation Learning in Discounted Linear MDPs without exploration assumptions
di: Viano, Luca, et al.
Pubblicazione: (2024)

Computing Nash Equilibria in Potential Games with Private Uncoupled Constraints
di: Patris, Nikolas, et al.
Pubblicazione: (2024)

Distributed Learning for Dynamic Congestion Games
di: Li, Hongbo, et al.
Pubblicazione: (2024)

Efficient Uncoupled Learning Dynamics with $\tilde{O}\!\left(T^{-1/4}\right)$ Last-Iterate Convergence in Bilinear Saddle-Point Problems over Convex Sets under Bandit Feedback
di: Maiti, Arnab, et al.
Pubblicazione: (2026)

Convex Markov Games and Beyond: New Proof of Existence, Characterization and Learning Algorithms for Nash Equilibria
di: Barakat, Anas, et al.
Pubblicazione: (2026)

On the Convergence of No-Regret Dynamics in Information Retrieval Games with Proportional Ranking Functions
di: Madmon, Omer, et al.
Pubblicazione: (2024)

Uncoupled and Convergent Learning in Monotone Games under Bandit Feedback
di: Dong, Jing, et al.
Pubblicazione: (2024)

Scale-Invariant Regret Matching and Online Learning with Optimal Convergence: Bridging Theory and Practice in Zero-Sum Games
di: Zhang, Brian Hu, et al.
Pubblicazione: (2025)

Altruism Improves Congestion in Series-Parallel Nonatomic Congestion Games
di: Hill, Colton, et al.
Pubblicazione: (2024)

Best of Both Worlds: Regret Minimization versus Minimax Play
di: Müller, Adrian, et al.
Pubblicazione: (2025)

Efficient $Φ$-Regret Minimization with Low-Degree Swap Deviations in Extensive-Form Games
di: Zhang, Brian Hu, et al.
Pubblicazione: (2024)

Public Signals in Network Congestion Games
di: Griesbach, Svenja M., et al.
Pubblicazione: (2022)

Computational Lower Bounds for Regret Minimization in Normal-Form Games
di: Anagnostides, Ioannis, et al.
Pubblicazione: (2024)

Satisfaction and Regret in Stackelberg Games
di: White, Langford, et al.
Pubblicazione: (2024)

Human-in-the-loop Learning for Dynamic Congestion Games
di: Li, Hongbo, et al.
Pubblicazione: (2024)

Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
di: Cai, Yang, et al.
Pubblicazione: (2023)

Last-Iterate Convergence of No-Regret Learning for Equilibria in Bargaining Games
di: Kamp, Serafina, et al.
Pubblicazione: (2025)

Minimizing Rosenthal's Potential in Monotone Congestion Games
di: Bilò, Vittorio, et al.
Pubblicazione: (2024)

Cooperate or Compete: Coalition Formation in Congestion Games
di: Sultana, Riya, et al.
Pubblicazione: (2024)

Algorithms and Complexity for Computing Nash Equilibria in Adversarial Team Games
di: Anagnostides, Ioannis, et al.
Pubblicazione: (2023)

Matching Multiple Experts: On the Exploitability of Multi-Agent Imitation Learning
di: Bergerault, Antoine, et al.
Pubblicazione: (2026)

p-Mean Regret for Stochastic Bandits
di: Krishna, Anand, et al.
Pubblicazione: (2024)

Regret Analysis of Sleeping Competing Bandits
di: Uba, Shinnosuke, et al.
Pubblicazione: (2026)

Characterizing the Convergence of Game Dynamics via Potentialness
di: Bichler, Martin, et al.
Pubblicazione: (2025)

Robust Information Design with Heterogeneous Beliefs in Bayesian Congestion Games
di: Hu, Yuwei, et al.
Pubblicazione: (2026)

Correlated vs. Uncorrelated Randomness in Adversarial Congestion Team Games
di: Orzech, Edan, et al.
Pubblicazione: (2023)