Efficiency in Negotiation: Complexity and Costly Bargaining

Even with complete information, two-person bargaining can generate a large number of equilibria, involving disagreements and inefficiencies, in (i) negotiation games where disagreement payoffs are endogenously determined (Busch and Wen, 1995) and (ii) costly bargaining games where there are transaction/participation costs (Anderlini and Felli, 2001). We show that when the players have (at the margin) a preference for less complex strategies only efficient equilibria survive in negotiation games (with sufficiently patient players) while, in sharp contrast, it is only the most inefficient outcome involving perpetual disagreement that survives in costly bargaining games. We also find that introducing small transaction costs to negotiation games dramatically alters the selection result: perpetual disagreement becomes the only feasible equilibrium outcome. Thus, in both alternating-offers bargaining games and repeated games with exit options (via bargaining and contracts), complexity considerations establish that the Coase Theorem is valid if and only if there are no transaction/participation costs.Bargaining, Repeated Game, Coase Theorem, Transaction Cost, Complexity, Bounded Rationality, Automaton