Taming the exponential action set: Sublinear regret and fast convergence to nash equilibrium in online congestion games
The congestion game is a powerful model that encompasses a range of engineering
systems such as traffic networks and resource allocation. It describes the behavior of a …
systems such as traffic networks and resource allocation. It describes the behavior of a …
Convergence to Nash Equilibrium and No-regret Guarantee in (Markov) Potential Games
In this work, we study potential games and Markov potential games under stochastic cost
and bandit feedback. We propose a variant of the Frank-Wolfe algorithm with sufficient …
and bandit feedback. We propose a variant of the Frank-Wolfe algorithm with sufficient …
[PDF][PDF] Learning in concave games with imperfect information
P Mertikopoulos - arXiv preprint arXiv:1608.07310, 2016 - core.ac.uk
This paper examines the convergence properties of a class of learning schemes for concave
N-person games–that is, games with convex action spaces and individually concave payoff …
N-person games–that is, games with convex action spaces and individually concave payoff …