IDEAS home Printed from https://ideas.repec.org/p/hal/journl/ujm-00162449.html
   My bibliography  Save this paper

Bounded rationality and repeated network formation

Author

Listed:
  • Sylvain Béal

    (CREUSET - Centre de Recherche Economique de l'Université de Saint-Etienne - UJM - Université Jean Monnet - Saint-Étienne)

  • Nicolas Quérou

    (School of Management and Economics - QUB - Queen's University [Belfast])

Abstract

We define a finite-horizon repeated network formation game with consent and study the differences induced by two levels of individual rationality. Perfectly rational players will remain unconnected at the equilibrium, while nonempty equilibrium networks may form when players are assumed to behave as finite automata of limited complexity. We provide structural properties of the sequences of networks which are likely to form in Nash and subgame perfect Nash equilibria of the repeated game. For instance, players can form totally different connected networks at each period or the sequence of networks can exhibit a total order relationship.

Suggested Citation

  • Sylvain Béal & Nicolas Quérou, 2007. "Bounded rationality and repeated network formation," Post-Print ujm-00162449, HAL.
    • Handle: RePEc:hal:journl:ujm-00162449
    DOI: 10.1016/j.mathsocsci.2007.03.003
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Gilles, R.P. & Sarangi, S., 2004. "Social Network Formation with Consent," Discussion Paper 2004-70, Tilburg University, Center for Economic Research.
    2. Ellison, Glenn, 1993. "Learning, Local Interaction, and Coordination," Econometrica, Econometric Society, vol. 61(5), pages 1047-1071, September.
    3. Dutta, Bhaskar & Ghosal, Sayantan & Ray, Debraj, 2005. "Farsighted network formation," Journal of Economic Theory, Elsevier, vol. 122(2), pages 143-164, June.
    4. Patrick Bolton & Mathias Dewatripont, 1994. "The Firm as a Communication Network," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 109(4), pages 809-839.
    5. Neyman, Abraham, 1985. "Bounded complexity justifies cooperation in the finitely repeated prisoners' dilemma," Economics Letters, Elsevier, vol. 19(3), pages 227-229.
    6. Glenn Ellison & Drew Fudenberg, 1995. "Word-of-Mouth Communication and Social Learning," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 110(1), pages 93-125.
    7. Abraham Neyman, 1998. "Finitely Repeated Games with Finite Automata," Mathematics of Operations Research, INFORMS, vol. 23(3), pages 513-552, August.
    8. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
    9. 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.
    10. Jackson, Matthew O. & Wolinsky, Asher, 1996. "A Strategic Model of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 71(1), pages 44-74, October.
    11. Goyal, Sanjeev & Vega-Redondo, Fernando, 2005. "Network formation and social coordination," Games and Economic Behavior, Elsevier, vol. 50(2), pages 178-207, February.
    12. Robert P. Gilles & Sudipta Sarangi, 2006. "Building Social Networks," Discussion Papers of DIW Berlin 642, DIW Berlin, German Institute for Economic Research.
    13. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
    14. Venkatesh Bala & Sanjeev Goyal, 2000. "A Noncooperative Model of Network Formation," Econometrica, Econometric Society, vol. 68(5), pages 1181-1230, September.
    15. Rubinstein, Ariel, 1986. "Finite automata play the repeated prisoner's dilemma," Journal of Economic Theory, Elsevier, vol. 39(1), pages 83-96, June.
    16. Watts, Alison, 2002. "Non-myopic formation of circle networks," Economics Letters, Elsevier, vol. 74(2), pages 277-282, January.
    17. Herbert A. Simon, 1955. "A Behavioral Model of Rational Choice," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 69(1), pages 99-118.
    18. Jackson, Matthew O. & Watts, Alison, 2002. "The Evolution of Social and Economic Networks," Journal of Economic Theory, Elsevier, vol. 106(2), pages 265-295, October.
    19. Watts, Alison, 2001. "A Dynamic Model of Network Formation," Games and Economic Behavior, Elsevier, vol. 34(2), pages 331-341, February.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Schuster, Stephan, 2010. "Network Formation with Adaptive Agents," MPRA Paper 27388, University Library of Munich, Germany.
    2. Schuster, Stephan, 2012. "Applications in Agent-Based Computational Economics," MPRA Paper 47201, University Library of Munich, Germany.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Roland Pongou & Roberto Serrano, 2009. "A Dynamic Theory of Fidelity Networks with an Application to the Spread of HIV/AIDS," Working Papers 2009-2, Brown University, Department of Economics.
    2. Page, Frank Jr. & Wooders, Myrna H. & Kamat, Samir, 2005. "Networks and farsighted stability," Journal of Economic Theory, Elsevier, vol. 120(2), pages 257-269, February.
    3. Marco Mantovani & Georg Kirchsteiger & Ana Mauleon & Vincent Vannetelbosch, 2011. "Myopic or Farsighted? An Experiment on Network Formation," Working Papers 2011.45, Fondazione Eni Enrico Mattei.
    4. Hernández, Penélope & Urbano, Amparo, 2008. "Codification schemes and finite automata," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 395-409, November.
    5. Sommarat Chantarat & Christopher Barrett, 2012. "Social network capital, economic mobility and poverty traps," The Journal of Economic Inequality, Springer;Society for the Study of Economic Inequality, vol. 10(3), pages 299-342, September.
    6. Kirchsteiger, Georg & Mantovani, Marco & Mauleon, Ana & Vannetelbosch, Vincent, 2016. "Limited farsightedness in network formation," Journal of Economic Behavior & Organization, Elsevier, vol. 128(C), pages 97-120.
    7. Joost Vandenbossche & Thomas Demuynck, 2013. "Network Formation with Heterogeneous Agents and Absolute Friction," Computational Economics, Springer;Society for Computational Economics, vol. 42(1), pages 23-45, June.
    8. Fabien Mercier, 2016. "Intermediary networks under the rule of equi-repartition of profits," Journal of Banking and Financial Economics, University of Warsaw, Faculty of Management, vol. 1(5), pages 39-63, June.
    9. Jean-François Caulier & Michel Grabisch & Agnieszka Rusinowska, 2015. "An allocation rule for dynamic random network formation processes," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 60(2), pages 283-313, October.
    10. Bryan S. Graham, 2015. "Methods of Identification in Social Networks," Annual Review of Economics, Annual Reviews, vol. 7(1), pages 465-485, August.
    11. Frank H. Page & Myrna H. Wooders, 2009. "Endogenous Network Dynamics," Working Papers 2009.28, Fondazione Eni Enrico Mattei.
    12. AJ Bostian & David Goldbaum, 2016. "Emergent Coordination among Competitors," Working Paper Series 36, Economics Discipline Group, UTS Business School, University of Technology, Sydney.
    13. Feri, Francesco, 2007. "Stochastic stability in networks with decay," Journal of Economic Theory, Elsevier, vol. 135(1), pages 442-457, July.
    14. Hellmann, Tim & Staudigl, Mathias, 2014. "Evolution of social networks," European Journal of Operational Research, Elsevier, vol. 234(3), pages 583-596.
    15. Dev, Pritha, 2010. "Choosing `Me' and `My Friends': Identity in a Non-Cooperative Network Formation Game with Cost Sharing," MPRA Paper 21631, University Library of Munich, Germany.
    16. Schuster, Stephan, 2012. "Applications in Agent-Based Computational Economics," MPRA Paper 47201, University Library of Munich, Germany.
    17. Edward Cartwright, 2002. "Learning to play approximate Nash equilibria in games with many players," Levine's Working Paper Archive 506439000000000070, David K. Levine.
    18. Vega-Redondo, Fernando, 2006. "Building up social capital in a changing world," Journal of Economic Dynamics and Control, Elsevier, vol. 30(11), pages 2305-2338, November.
    19. , D. & Tessone, Claudio J. & ,, 2014. "Nestedness in networks: A theoretical model and some applications," Theoretical Economics, Econometric Society, vol. 9(3), September.
    20. Ueda, Masahiko, 2023. "Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners’ dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).

    More about this item

    Keywords

    Repeated network formation game; Two-sided link formation costs; Bounded rationality; Automata; Subgame perfection;
    All these keywords.

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hal:journl:ujm-00162449. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: CCSD (email available below). General contact details of provider: https://hal.archives-ouvertes.fr/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.