For the class of shortest path games, we propose a family of new cost sharing rules satisfying core selection. These rules allocate shares according to some lexicographic preference relation. A computational procedure is provided. Our results relate to those of Tijs et al. (2011).

We study the provision of a public good in a social network where links are directed, i.e., the information flows one way. Our results relate, through stochastic dominance, the equilibrium outcome of such a process with the out-degree distribution of the network.

I develop a model where workers decide how hard to look for a job via formal and informal search channels. The intensity of formal search determines an individual’s arrival rate of offers. The strength of investment in informal search translates into a job contact network in which job offers...

I investigate how an incumbent firm deters entry by crowding the market, even when the incumbent can withdraw its stores in response to entry. In a two-location model, Judd (1985) shows such spatial entry deterrence is not credible. In contrast, I demonstrate spatial preemption can be credibly...

I consider repeated games with local monitoring: each player observes his neighbors’ moves only. Hence, monitoring is private and imperfect. Communication is private: each player can send different (costless) messages to different players. The solution concept is perfect Bayesian equilibrium....

Consider a contest for a prize in which each player knows his/her own ability, but may or may not know those of his/her rivals (the complete or incomplete information regimes). Our main result is that, if the value of the prize is high, more effort and output are engendered under incomplete...

In this paper we relax the Colonel Blotto game assumption that for a given battle the player who allocates the higher measure of resources wins that battle. We assume that for a given battle, the Colonel who allocates the higher measure of resources is more likely to win. We have a simpler model...

This paper examines zero-sum games that are based on a cyclic preference relation defined over undistinguished actions. For each of these games, the set of Nash equilibria is characterized. When the number of actions is odd, a unique Nash equilibrium is always obtained. On the other hand, in the...

Arad and Rubinstein (2012a) have designed a novel game to study level-k reasoning experimentally. Just like them, we find that the depth of reasoning is very limited and clearly different from that in equilibrium play. We show that such behavior is even robust to repetitions; hence there is, at...

We experimentally analyse simultaneous behaviour in a contest game and a public good game, whose endowment is shared. Competition for resources (i) almost eliminates overbidding, without affecting public good contributions and (ii) almost eliminates the behavioural spillovers between the games.