Bargaining in Stationary Networks

We study an infinite horizon game in which pairs of players connected in a network are randomly matched to bargain. Players who reach agreement are replaced by new players at the same positions in the network. We show that all equilibria are payoff equivalent. The payoffs and the set of agreement li...

Full description

Bibliographic Details
Main Author: Manea, Mihai (Contributor)
Other Authors: Massachusetts Institute of Technology. Department of Economics (Contributor)
Format: Article
Language:English
Published: American Economic Association, 2012-09-17T19:14:52Z.
Subjects:
Online Access:Get fulltext
LEADER 01223 am a22001813u 4500
001 73022
042 |a dc 
100 1 0 |a Manea, Mihai  |e author 
100 1 0 |a Massachusetts Institute of Technology. Department of Economics  |e contributor 
100 1 0 |a Manea, Mihai  |e contributor 
100 1 0 |a Manea, Mihai  |e contributor 
245 0 0 |a Bargaining in Stationary Networks 
260 |b American Economic Association,   |c 2012-09-17T19:14:52Z. 
856 |z Get fulltext  |u http://hdl.handle.net/1721.1/73022 
520 |a We study an infinite horizon game in which pairs of players connected in a network are randomly matched to bargain. Players who reach agreement are replaced by new players at the same positions in the network. We show that all equilibria are payoff equivalent. The payoffs and the set of agreement links converge as players become patient. Several new concepts-mutually estranged sets, partners, and shortage ratios-provide insights into the relative strengths of the positions in the network. We develop a procedure to determine the limit equilibrium payoffs for all players. Characterizations of equitable and nondiscriminatory networks are also obtained. 
546 |a en_US 
655 7 |a Article 
773 |t American Economic Review