Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Bargaining in Stationary Networks

Bargaining in Stationary Networks

Thumbnail Image
Download
Name

Manea_Bargaining in.pdf

Size

957.02 KB

Format

Adobe PDF

Checksum (MD5)

4d99cba8ec3c34dd0d7c362b5978eef2

Author(s)
Manea, Mihai
Date Issued
August 2011
Journal
American Economic Review
Publisher
American Economic Association
Citation
Manea, Mihai. “Bargaining in Stationary Networks.” American Economic Review 101.5 (2011): 2042–2080. Web. © 2011 American Economic Association.
Version
Final published version
Abstract
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.
MIT Department
Massachusetts Institute of Technology. Department of Economics
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
http://hdl.handle.net/1721.1/73022
DOI of Published Version
https://doi.org/10.1257/aer.101.5.2042
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.