Future cities promise to be more autonomous than ever, largely owing to our ability of
coordinating complex systems in real time: fleets of self-driving cars will offer on-demand …

Computer science and economics have engaged in a lively interaction over the past fifteen
years, resulting in the new field of algorithmic game theory. Many problems that are central …

An analysis of the loss in performance caused by selfish, uncoordinated behavior in
networks. Most of us prefer to commute by the shortest route available, without taking into …

Network design is a fundamental problem for which it is important to understand the effects
of strategic behavior. Given a collection of self-interested agents who want to form a network …

The price of anarchy, defined as the ratio of the worst-case objective function value of a
Nash equilibrium of a game and that of an optimal outcome, quantifies the inefficiency of …

Most existing results about last-iterate convergence of learning dynamics are limited to two-
player zero-sum games, and only apply under rigid assumptions about what dynamics the …

The essence of the routing problem in real networks is that the traffic demand from a source
to destination must be satisfied by choosing a single path between source and destination …

Abstract The Multiplicative Weights Update (MWU) method is a ubiquitous meta-algorithm
that works as follows: A distribution is maintained on a certain set, and at each step the …

This study explores the impact of content creators' competition on user welfare in
recommendation platforms, as well as the long-term dynamics of relevance-driven …

We study the ability of decentralized, local dynamics in non-cooperative games to rapidly
reach an approximate (pure) Nash equilibrium. Our main result states that for symmetric …