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

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