Rubinstein and Wolinsky (1990) show that a simple homogeneous market with exogenous matching has continuum of (non-competitive) perfect equilibria, but the unique Markov perfect equilibrium is competitive. By contrast, in the more general case of heterogeneous markets, we show there exists a...

Rubinstein and Wolinsky (1990) show that a simple homogeneous market with exogenous matching has a continuum of (non-competitive) perfect equilibria; however, the unique Markov perfect equilibrium is competitive. By contrast, in the more general case of heterogeneous markets, we show there exists...

This paper considers the ‘negotiation game’ (Busch and Wen [4]) which combines the features of two-person alternating offers and repeated games. Despite the forces of bargaining, the negotiation game in general admits a large number of equilibria, some of which involve delay in agreement and...

This paper examines repeated implementation of a social choice function (SCF) with infinitely-lived agents whose preferences are determined randomly in each period. An SCF is repeated-implementable in (Bayesian) Nash equilibrium if there exists a sequence of (possibly history-dependent)...

Confirmation bias refers to cognitive errors that bias one towards one's own prior beliefs. A vast empirical literature documents its existence and psychologists identify it as one of the most problematic aspects of human reasoning. In this paper, we present three related scenarios where...

Rational herd behavior and informationally efficient security prices have long been considered to be mutually exclusive but for exceptional cases. In this paper we describe the conditions on the underlying information structure that are necessary and sufficient for informational herding and...

The authors investigate the effect of introducing costs of complexity in the n- person unanimity bargaining game. In particular, the paper provides a justification for stationary equilibrium strategies in the class of games where complexity costs matter. As is well-known, every individually...

We consider a multi-award generalisation of King Solomon’s problem: k identical and indivisible awards should be distributed among agents, k < n, with the top k valuation agents receiving the awards. Agents have complete information about each other’s valuations. Glazer and Ma (1989) analysed the single-prize (i.e. k = 1) version of this problem. We show that in the ‘more than two agents’ problem the mechanism of Glazer and Ma admits inefficient equilibria and thus fails to solve Solomon’s problem. So, first we modify their mechanism to rule out inefficient equilibria and implement efficient prize allocation in sub-game perfect equilibrium when there are at least three agents. Then it is shown that a simple repeated application of our modified mechanism will distribute k (>1) prizes efficiently in sub-game perfect equilibria without any monetary transfers in equilibrium. Finally, in the multi-awards case we relax the...</n,>

This note is a response to an unpublished paper by Evans and Thomas (1998) of which we have recently become aware. Evans and Thomas (1998) take issue with a paper that we published some years back on 'Cooperation and Effective Computability' in repeated games (Anderlini and Sabourian 1995). In...