Bounded rationality and repeated network formation
AbstractWe define a finite-horizon repeated network formation game with consent, and study the differences induced by different levels of individual rationality. We prove that perfectly rational players will remain unconnected at the equilibrium, while nonempty equilibrium networks may form when, following Neyman (1985), players are assumed to behave as finite automata. We define two types of equilibria, namely the Repeated Nash Network (RNN), in which the same network forms at each period, and the Repeated Nash Equilibrium (RNE), in which different networks may form. We state a sufficient condition under which a given network may be implemented as a RNN. Then, we provide structural properties of RNE. For instance, players may form totally different networks at each period, or the networks within a given RNE may exhibit a total order relationship. Finally we investigate the question of efficiency for both Bentham and Pareto criteria.
Download InfoIf 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.
Bibliographic InfoArticle provided by Elsevier in its journal Mathematical Social Sciences.
Volume (Year): 54 (2007)
Issue (Month): 1 (July)
Contact details of provider:
Web page: http://www.elsevier.com/locate/inca/505565
Other versions of this item:
- Nicolas Querou & Sylvain Beal, 2006. "Bounded Rationality and Repeated Network Formation," Working Papers 2006.74, Fondazione Eni Enrico Mattei.
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
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.:
- Robert P. Gilles & Sudipta Sarangi, 2006. "Building Social Networks," Discussion Papers of DIW Berlin 642, DIW Berlin, German Institute for Economic Research.
- Venkatesh Bala & Sanjeev Goyal, 2000. "A Noncooperative Model of Network Formation," Econometrica, Econometric Society, vol. 68(5), pages 1181-1230, September.
- Mathias Dewatripont & Patrick Bolton, 1996.
"The firm as a communication network,"
ULB Institutional Repository
2013/9597, ULB -- Universite Libre de Bruxelles.
- Mathias Dewatripont & Patrick Bolton, 2004. "The firm as a communication network," ULB Institutional Repository 2013/9599, ULB -- Universite Libre de Bruxelles.
- Mathias Dewatripont & Patrick Bolton, 1994. "The firm as a communication network," ULB Institutional Repository 2013/9595, ULB -- Universite Libre de Bruxelles.
- A. Banerjee & Drew Fudenberg, 2010.
"Word-of-Mouth Communication and Social Learning,"
Levine's Working Paper Archive
425, David K. Levine.
- Gilles, R.P. & Sarangi, S., 2004. "Social Network Formation with Consent," Discussion Paper 2004-70, Tilburg University, Center for Economic Research.
- Rubinstein, Ariel, 1986.
"Finite automata play the repeated prisoner's dilemma,"
Journal of Economic Theory,
Elsevier, vol. 39(1), pages 83-96, June.
- Ariel Rubinstein, 1997. "Finite automata play the repeated prisioners dilemma," Levine's Working Paper Archive 1639, David K. Levine.
- Matthew O. Jackson & Asher Wolinsky, 1994.
"A Strategic Model of Social and Economic Networks,"
1098, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Watts, Alison, 2002. "Non-myopic formation of circle networks," Economics Letters, Elsevier, vol. 74(2), pages 277-282, January.
- Kalai, Ehud & Stanford, William, 1988.
"Finite Rationality and Interpersonal Complexity in Repeated Games,"
Econometric Society, vol. 56(2), pages 397-410, March.
- Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Sanjeev Goyal & Fernando Vega-Redondo, 2003. "Network Formation and Social Coordination," Working Papers 481, Queen Mary, University of London, School of Economics and Finance.
- Goyal, Sanjeev & Vega-Redondo, Fernando, 2005. "Network formation and social coordination," Games and Economic Behavior, Elsevier, vol. 50(2), pages 178-207, February.
- Matt Jackson, 2003.
"The Effects of Social Networks on Employment and Inequality,"
Theory workshop papers
658612000000000032, UCLA Department of Economics.
- Antoni Calvó-Armengol & Matthew O. Jackson, 2004. "The Effects of Social Networks on Employment and Inequality," American Economic Review, American Economic Association, vol. 94(3), pages 426-454, June.
- Dutta, Bhaskar & Ghosal, Sayantan & Ray, Debraj, 2005.
"Farsighted network formation,"
Journal of Economic Theory,
Elsevier, vol. 122(2), pages 143-164, June.
- Ellison, Glenn, 1993.
"Learning, Local Interaction, and Coordination,"
Econometric Society, vol. 61(5), pages 1047-71, September.
- Jackson, Matthew O., 1998.
"The Evolution of Social and Economic Networks,"
1044, California Institute of Technology, Division of the Humanities and Social Sciences.
- Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
- Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-81, November.
- Schuster, Stephan, 2010. "Network Formation with Adaptive Agents," MPRA Paper 27388, University Library of Munich, Germany.
- Schuster, Stephan, 2012. "Applications in Agent-Based Computational Economics," MPRA Paper 47201, University Library of Munich, Germany.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Zhang, Lei).
If references are entirely missing, you can add them using this form.