Generalized mirror descents in congestion games
From MaRDI portal
Publication:334813
DOI10.1016/j.artint.2016.09.002zbMath1406.91069arXiv1605.07774OpenAlexW2398693750MaRDI QIDQ334813
Publication date: 1 November 2016
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.07774
Related Items (4)
Generalized mirror descents with non-convex potential functions in atomic congestion games: continuous time and discrete time ⋮ A reinforcement learning scheme for the equilibrium of the in-vehicle route choice problem based on congestion game ⋮ Leadership in singleton congestion games: what is hard and what is easy ⋮ An alternating algorithm for finding linear Arrow-Debreu market equilibria
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Convergence to equilibrium of logit dynamics for strategic games
- Load balancing without regret in the bulletin board model
- The weighted majority algorithm
- Introductory lectures on convex optimization. A basic course.
- Mirror descent and nonlinear projected subgradient methods for convex optimization.
- Adaptive game playing using multiplicative weights
- Circumventing the Price of Anarchy: Leading Dynamics to Good Behavior
- The complexity of pure Nash equilibria
- The Nonstochastic Multiarmed Bandit Problem
- Concurrent imitation dynamics in congestion games
- Intrinsic robustness of the price of anarchy
- On the convergence of regret minimization dynamics in concave games
- Multiplicative updates outperform generic no-regret learning in congestion games
- Routing without regret
- Interior-Point Methods for Full-Information and Bandit Online Learning
- Fast Convergence to Wardrop Equilibria by Adaptive Sampling Methods
- Algorithmic Game Theory
- Tatonnement beyond gross substitutes?
This page was built for publication: Generalized mirror descents in congestion games
