Online Monotone Games

by   Ian Gemp, et al.

Algorithmic game theory (AGT) focuses on the design and analysis of algorithms for interacting agents, with interactions rigorously formalized within the framework of games. Results from AGT find applications in domains such as online bidding auctions for web advertisements and network routing protocols. Monotone games are games where agent strategies naturally converge to an equilibrium state. Previous results in AGT have been obtained for convex, socially-convex, or smooth games, but not monotone games. Our primary theoretical contributions are defining the monotone game setting and its extension to the online setting, a new notion of regret for this setting, and accompanying algorithms that achieve sub-linear regret. We demonstrate the utility of online monotone game theory on a variety of problem domains including variational inequalities, reinforcement learning, and generative adversarial networks.



There are no comments yet.


page 1

page 2

page 3

page 4


Optimal No-Regret Learning in Strongly Monotone Games with Bandit Feedback

We consider online no-regret learning in unknown games with bandit feedb...

Adaptive Learning in Continuous Games: Optimal Regret Bounds and Convergence to Nash Equilibrium

In game-theoretic learning, several agents are simultaneously following ...

Nonsmooth Aggregative Games with Coupling Constraints and Infinitely Many Classes of Players

After defining a pure-action profile in a nonatomic aggregative game, wh...

Continuous-Time Convergence Rates in Potential and Monotone Games

In this paper, we provide exponential rates of convergence to the Nash e...

Online Optimization in Games via Control Theory: Connecting Regret, Passivity and Poincaré Recurrence

We present a novel control-theoretic understanding of online optimizatio...

Transitions, Losses, and Re-parameterizations: Elements of Prediction Games

This thesis presents some geometric insights into three different types ...

Routing Games in the Wild: Efficiency, Equilibration and Regret (Large-Scale Field Experiments in Singapore)

Routing games are amongst the most well studied domains of game theory. ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.