Markov Equilibria in a Model of Bargaining in Networks
Dilip Abreu and
Mihai Manea
Additional contact information
Dilip Abreu: Princeton University
No 1359, Working Papers from Princeton University, Department of Economics, Econometric Research Program.
Abstract:
We study the Markov perfect equilibria (MPEs) of an infinite horizon game in which pairs of players connected in a network are randomly matched to bargain. Players who reach agreement are removed from the network without replacement. We establish the existence of MPEs and show that MPE payoffs are not necessarily unique. A method for constructing pure strategy MPEs for high discount factors is developed. For some networks, we find that all MPEs are asymptotically inefficient as players become patient.
JEL-codes: C01 C70 (search for similar items in EconPapers)
Date: 2011-09
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
http://detc.princeton.edu/wp-content/uploads/2017/01/wp025_2011_Abreu_Manea.pdf
Our link check indicates that this URL is bad, the error code is: 404 Not Found (http://detc.princeton.edu/wp-content/uploads/2017/01/wp025_2011_Abreu_Manea.pdf [302 Found]--> https://detc.princeton.edu/wp-content/uploads/2017/01/wp025_2011_Abreu_Manea.pdf [301 Moved Permanently]--> https://economics.princeton.edu/the-william-s-dietrich-ii-economic-theory-center/wp-content/uploads/2017/01/wp025_2011_Abreu_Manea.pdf)
Related works:
Journal Article: Markov equilibria in a model of bargaining in networks (2012) 
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:pri:metric:025_2011
Access Statistics for this paper
More papers in Working Papers from Princeton University, Department of Economics, Econometric Research Program. Contact information at EDIRC.
Bibliographic data for series maintained by Bobray Bordelon ().