Bargaining and efficiency in networks
Dilip Abreu and
Mihai Manea
Journal of Economic Theory, 2012, vol. 147, issue 1, 43-70
Abstract:
We study an infinite horizon game in which pairs of players connected in a network are randomly matched to bargain over a unit surplus. Players who reach agreement are removed from the network without replacement. The global logic of efficient matchings and the local nature of bargaining, in combination with the irreversible exit of player pairs following agreements, create severe hurdles to the attainment of efficiency in equilibrium. For many networks all Markov perfect equilibria of the bargaining game are inefficient, even as players become patient. We investigate how incentives need to be structured in order to achieve efficiency via subgame perfect, but non-Markovian, equilibria. The analysis extends to an alternative model in which individual players are selected according to some probability distribution, and a chosen player can select a neighbor with whom to bargain.
Keywords: Networks; Bargaining; Efficiency; Random matching; Decentralized markets; Stochastic games (search for similar items in EconPapers)
JEL-codes: C7 D6 (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (46)
Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0022053111001554
Full text for ScienceDirect subscribers only
Related works:
Working Paper: Bargaining and Efficiency in Networks (2011) 
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:eee:jetheo:v:147:y:2012:i:1:p:43-70
DOI: 10.1016/j.jet.2011.11.003
Access Statistics for this article
Journal of Economic Theory is currently edited by A. Lizzeri and K. Shell
More articles in Journal of Economic Theory from Elsevier
Bibliographic data for series maintained by Catherine Liu ().