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 …

We initiate the study of efficient mechanism design with guaranteed good properties even
when players participate in multiple mechanisms simultaneously or sequentially. We define …

Computational tractability and social welfare (aka. efficiency) of equilibria are two
fundamental but in general orthogonal considerations in algorithmic game theory …

Policy gradient methods enjoy strong practical performance in numerous tasks in
reinforcement learning. Their theoretical understanding in multiagent settings, however …

We define smooth games of incomplete information. We prove an" extension theorem" for
such games: price of anarchy bounds for pure Nash equilibria for all induced full-information …

Abstract The Generalized Second Price (GSP) auction is the primary auction used for
monetizing the use of the Internet. It is well-known that truthtelling is not a dominant strategy …

Game theory has emerged as a fruitful paradigm for the design of networked multiagent
systems. A fundamental component of this approach is the design of agents' utility functions …

We study the inefficiency of equilibria for congestion games when players are (partially)
altruistic. We model altruistic behavior by assuming that player i's perceived cost is a convex …

Today's multiagent systems have grown too complex to rely on centralized controllers,
prompting increasing interest in the design of distributed algorithms. In this respect, game …

We define smooth games of incomplete information. We prove an''extension theorem” for
such games: price of anarchy bounds for pure Nash equilibria for all induced full-information …