I consider a flexible framework of strategic interactions under incomplete information in which, prior to committing their actions (consumption, production, or investment decisions), agents choose the attention to allocate to an arbitrarily large number of information sources about the primitive...

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

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

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 notion of communication equilibrium extends Aumann's [3] correlated equilibrium concept for complete information games to the case of incomplete information. This paper shows that this solution concept has the following property: for the class of incomplete information games with compact...

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

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 present an extension to any finite complete information game with two players. In the extension, players are allowed to communicate directly and, additionally, send private messages to a simple, detail-free mediator, which, in turn, makes public announcements as a deterministic function of...

A game of incomplete information can be decomposed into a basic game and an information structure. The basic game defines the set of actions, the set of payoff states the payoff functions and the common prior over the payoff states. The information structure refers to the signals that the...