This short survey discusses recent findings on the robustness of Nash equilibria of strategic games with many semianonymous players. It describes the notion of structural robustness and its general consequences, as well as implications to particular games, such as ones played on the web and...

A central question in game theory and artificial intelligence is how a rational agent should behave in a complex environment, given that it cannot perform unbounded computations. We study strategic aspects of this question by formulating a simple model of a game with additional costs...

The sensitivity of Nash equilibrium to strategic and informational details presents a diØ culty in applying it to games which are not fully specified. Structurally-robust Nash equilibria are less sensitive to such details. More-over, they arrise naturally in important classes of games that have...