Response times are a simple low-cost indicator of the process of reasoning in strategic games (Rubinstein, 2007; Rubinstein, 2016). We leverage the dynamic nature of response-time data from repeated strategic interactions to measure the strategic complexity of a situation by how long people think on...

This paper reinterprets the ? -core (Chander and Tulkens (1995, 1997)) and justifies it as well as its prediction that the efficient coalition structure is stable in terms of the coalition formation theory. It is assumed that coalitions can freely merge or break apart, are farsighted (that is,...

The value is a solution concept for n-person strategic games, developed by Nash, Shapley, and Harsanyi. The value of a game is an a priori evaluation of the economic worth of the position of each player, reflecting the players' strategic possibilities, including their ability to make threats...

The equilibrium outcome of a strategic interaction between two or more people may depend on the weight they place on each other's payoff. A positive, negative or zero weight represents altruism, spite or complete selfishness, respectively. Paradoxically, the real, material payoff in equilibrium...

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

We show that essentially every communication equilibrium of any finite Bayesian game with two players can be implemented as a strategic form correlated equilibrium of an extended game, in which before choosing actions as in the Bayesian game, the players engage in a possibly infinitely long (but...