By Siddharth Chandak and others

Consider *N* players each with a *d*-dimensional action set. Each of the players' utility functions includes their reward function and a linear term for each dimension, with coefficients that are controlled by the manager. We assume that the game is strongly monotone, so if each player runs gradient descent, the... Show more

June 30, 2024

Loading full text...

Similar articles

Loading recommendations...

x1

Learning to Control Unknown Strongly Monotone Games

Click on play to start listening