Stability and Learning in Strategic Games

Over the last two decades we have developed good understanding how to quantify the impact of strategic user behavior on outcomes in many games (including traffic routing and online auctions) and showed that the resulting bounds extend to repeated games assuming players use a form of no-regret learning to adapt to the environment. We will review how this area evolved since its early days, and also discuss some of the new frontiers, including when repeated interactions have carry-over effects between rounds: when outcomes in one round effect the game in the future, as is the case in many applications. In this talk, we study this phenomenon in the context of a game modeling repeated auction with budgets and queuing systems: routers compete for servers, where packets that do not get served need to be resent, resulting in a system where the number of packets at each round depends on the success of the routers in the previous rounds. In joint work with Giannis Fikioris and Jason Gaitonde respectively, we analyze the resulting highly dependent random processes, and show bounds on the resulting budgeted welfare for auctions and the excess server capacity needed to guarantee that all packets get served in the queuing system despite the selfish (myopic) behavior of the participants.

Please report video problems to itsupport@slmath.org.

See more of our Streaming videos on our main VMath Videos page.