It is shown that training of generative adversarial network (GAN) may not have good
generalization properties; eg, training may appear successful but the trained distribution …

Nash equilibrium is one of the most influential solution concepts in game theory. With the
development of computer science and artificial intelligence, there is an increasing demand …

How long does it take until economic agents converge to an equilibrium? By studying the
complexity of the problem of computing a mixed Nash equilibrium in a game, we provide …

We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is
complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) …

We investigate from the computational viewpoint multi-player games that are guaranteed to
have pure Nash equilibria. We focus on congestion games, and show that a pure Nash …

In multiagent systems, strategic settings are often analyzed under the assumption that the
players choose their strategies simultaneously. However, this model is not always realistic …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

This book offers a self-sufficient treatment of a key tool, game theory and mechanism design,
to model, analyze, and solve centralized as well as decentralized design problems involving …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

We reexamine what it means to compute Nash equilibria and, more generally, what it means
to compute a fixed point of a given Brouwer function, and we investigate the complexity of …