Bargaining and efficiency in networks
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.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
References listed on IDEAS
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Roth, Alvin E. & Sonmez, Tayfun & Utku Unver, M., 2005.
"Pairwise kidney exchange,"
Journal of Economic Theory,
Elsevier, vol. 125(2), pages 151-188, December.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2004. "Pairwise Kidney Exchange," Levine's Bibliography 122247000000000350, UCLA Department of Economics.
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Pairwise Kidney Exchange," Game Theory and Information 0408001, EconWPA, revised 16 Feb 2005.
- Alvin E. Roth & Tayfun Sönmez & M. Utku Ünver, 2004. "Pairwise Kidney Exchange," Boston College Working Papers in Economics 620, Boston College Department of Economics.
- Alvin E. Roth & Tayfun Sonmez & M. Utku Unver, 2004. "Pairwise Kidney Exchange," NBER Working Papers 10698, National Bureau of Economic Research, Inc.
- Moulin, Herve & Bogomolnaia, Anna, 2001.
"Random Matching under Dichotomous Preferences,"
2001-03, Rice University, Department of Economics.
- Gale, Douglas, 1987.
"Limit theorems for markets with sequential bargaining,"
Journal of Economic Theory,
Elsevier, vol. 43(1), pages 20-54, October.
- Douglas Gale, 2010. "Limit theorems for markets with sequential bargaining," Levine's Working Paper Archive 621, David K. Levine.
- Dale T. Mortensen, 1979.
"The Matching Process as a Non-Cooperative/Bargaining Game,"
384, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Dale T. Mortensen, 1982. "The Matching Process as a Noncooperative Bargaining Game," NBER Chapters, in: The Economics of Information and Uncertainty, pages 233-258 National Bureau of Economic Research, Inc.
- Peter A. Diamond, 1982. "Wage Determination and Efficiency in Search Equilibrium," Review of Economic Studies, Oxford University Press, vol. 49(2), pages 217-227.
- Pissarides, C A, 1979. "Job Matchings with State Employment Agencies and Random Search," Economic Journal, Royal Economic Society, vol. 89(356), pages 818-33, December.
- Arial Rubinstein & Asher Wolinsky, 1985.
"Equilibrium in a Market with Sequential Bargaining,"
Levine's Working Paper Archive
623, David K. Levine.
- Rubinstein, Ariel & Wolinsky, Asher, 1985. "Equilibrium in a Market with Sequential Bargaining," Econometrica, Econometric Society, vol. 53(5), pages 1133-50, September.
- Ariel Rubinstein & Asher Wolinsky, 1990. "Decentralized Trading, Strategic Behaviour and the Walrasian Outcome," Review of Economic Studies, Oxford University Press, vol. 57(1), pages 63-78.
- Mihai Manea, 2011. "Bargaining in Stationary Networks," American Economic Review, American Economic Association, vol. 101(5), pages 2042-80, August.
- Polanski, Arnold, 2007. "Bilateral bargaining in networks," Journal of Economic Theory, Elsevier, vol. 134(1), pages 557-565, May.
- Corominas-Bosch, Margarida, 2004. "Bargaining in a network of buyers and sellers," Journal of Economic Theory, Elsevier, vol. 115(1), pages 35-77, March.
- K. G. Binmore & M. J. Herrero, 1988. "Matching and Bargaining in Dynamic Markets," Review of Economic Studies, Oxford University Press, vol. 55(1), pages 17-31.
- Rachel E. Kranton & Deborah F. Minehart, 2001. "A Theory of Buyer-Seller Networks," American Economic Review, American Economic Association, vol. 91(3), pages 485-508, June.
- Arial Rubinstein & Asher Wolinsky, 1990. "Decentralized Trading, Strategic Behaviour and the Walrasian Outcome," Levine's Working Paper Archive 622, David K. Levine.
When requesting a correction, please mention this item's handle: RePEc:eee:jetheo:v:147:y:2012:i:1:p:43-70. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei)
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link to it, you can help with this form.
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your profile, as there may be some citations waiting for confirmation.
Please note that corrections may take a couple of weeks to filter through the various RePEc services.