This paper is a survey of the work in the Nash program for coalitional games, a research agenda proposed by Nash (1953) to bridge the gap between the non-cooperative and cooperative approaches to game theory.

We propose positive and normative foundations for the average prekernel of NTU games, and compare them with the existing ones for the prekernel. In our non-cooperative analysis, the average prekernel is understood as the equilibrium payoffs of a game where each player faces the possibility of...

We provide a mechanism that approximately implements the Mas-Colell bargaining set in subgame perfect equilibrium. The mechanism is based on the definition of the Mas-Colell bargaining set, and respects feasibility in and out of equilibrium.

We report experiments designed to test between Nash equilibria that are stable and unstable under learning. The 'TASP' (Time Average of the Shapley Polygon) gives a precise prediction about what happens when there is divergence from equilibrium under fictitious play like learning processes. We...

A core allocation of a complete information economy can be characterized as one that would not be unanimously rejected in favor of another feasible alternative by any coalition. We use this test of coalitional voting in an incomplete information environment to formalize a notion of resilience....

We apply farsighted stable set to two versions of Hotelling's location games: one with linear market and another with circular market. It is shown that there always exists a farsighted stable set in both games. In particular, the set of all location profiles that yields equal payoff across all...

It is well known that the rock-paper-scissors game has no pure saddle point. We show that this holds more generally: A symmetric two-player zero-sum game has a pure saddle point if and only if it is not a generalized rock-paper-scissors game. Moreover, we show that every finite symmetric...

Schelling (1969, 1971a,b, 1978) considered a simple proximity model of segregation where individual agents only care about the types of people living in their own local geographical neighborhood, the spatial structure being represented by one- or two-dimensional lattices. In this paper, we argue...

It is known that there are uncoupled learning heuristics leading to Nash equilibrium in all finite games. Why should players use such learning heuristics and where could they come from? We show that there is no uncoupled learning heuristic leading to Nash equilibrium in all finite games that a...

This paper studies the dynamic construction of a blockchain by competitive miners. In contrast to the literature, we assume a finite time horizon. It is shown that popular mining strategies such as adherence to conservative mining or to the longest-chain rule constitute pure-strategy Nash...