Many social networks have the following properties: (i) a short average distance between any two individuals; (ii) a high clustering coefficient; (iii) segregation patterns; the presence of (iv) brokers and (v) hubs. (i) and (ii) define a small world network. This paper develops a strategic...

We study the impact of advice or observation on the depth of reasoning in an experimental beauty-contest game. Both sources of information trigger faster convergence to the equilibrium. Yet, we find that subjects who receive naive advice outperform uninformed subjects permanently, whereas...

This paper considers rent-seeking games in which a small percentage change in a player's bid has a large percentage impact on her odds of winning, i.e., on the ratio of her respective probabilities of winning and losing. An example is the Tullock contest with a high R. The analysis provides a...

In the past, many refinements have been proposed to select equilibria in cheap talk games. Usually, these refinements were motivated by a discussion of how rational agents would reason in some particular cheap talk games. In this paper, we propose a new refinement and stability measure that is...

In three-person envy games, an allocator, a responder, and a dummy player interact. Since agreement payoffs of responder and dummy are exogenously given, there is no tradeoff between allocator payoff and the payoffs of responder and dummy. Rather, the allocator chooses the size of the pie and...

This paper makes three related contributions to noncooperative game theory: (i) a solution concept (the 'ICEU solution'), which is generated by an iterative procedure that constructs trinary partitions of strategy sets and deals with problems arising from weak dominance; (ii) a class of models of...

In classical game theory, players have finitely many actions and evaluate outcomes of mixed strategies using a von Neumann-Morgenstern utility function. Allowing a larger, but countable, player set introduces a host of phenomena that are impossible in finite games. Firstly, in coordination...

In games with costly signaling, some equilibria are vulnerable to deviations which could be "unambiguously" interpreted as coming from a unique set of Sender-types. This occurs when these types are precisely the ones who gain from deviating for any beliefs the Re-ceiver could form over that set....

In models of non-deterministic contest, players exert irreversible effort in order to increase their probability of winning a prize. The most prominent functional form of the win probability in the literature is the so-called "logitʺ contest success function. We provide a simple...

We define and analyze a "strategic topology" on types in the Harsanyi-Mertens-Zamir universal type space, where two types are close if their strategic behavior is similar in all strategic situations. For a fixed game and action define the distance between a pair of types as the difference...