Selfish, strategic players may benefit from cooperation, provided they reach agreement. It is therefore important to construct mechanisms that facilitate such cooperation, especially in the case of asymmetric private information. The two major issues are: (1) singling out a fair and efficient...

We revisit classic algorithmic search and optimization problems from the perspective of competition. Rather than a single optimizer minimizing expected cost, we consider a zero-sum game in which an optimization problem is presented to two players, whose only goal is to outperform the opponent....

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...

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...

How should a coalition of cooperating players allocate payoÞs to its members? This question arises in a broad range of situations and evokes an equally broad range of issues. For example, it raises technical issues in accounting, if the players are divisions of a corporation, but involves...