IDEAS home Printed from https://ideas.repec.org/p/yor/yorken/09-34.html
   My bibliography  Save this paper

Stable and Efficient Networks with Farsighted Players: the Largest Consistent Set

Author

Listed:
  • A Bhattacharya

Abstract

In this paper we study strategic formation of bilateral networks with farsighted players in the classic framework of Jackson and Wolinsky (1996). We use the largest consistent set (LCS)(Chwe (1994)) as the solution concept for stability. We show that there exists a value function such that for every component balanced and anonymous allocation rule, the corresponding LCS does not contain any strongly efficient network. Using Pareto efficiency, a weaker concept of efficiency, we get a more positive result. However, then also, at least one environment of networks (with a component balanced and anonymous allocation rule) exists for which the largest consistent set does not contain any Pareto efficient network. These confirm that the well-known problem of the incompatibility between the set of stable networks and the set of efficient networks persists even in the environment with farsighted players. Next we study some possibilities of resolving this incompatibility.

Suggested Citation

  • A Bhattacharya, "undated". "Stable and Efficient Networks with Farsighted Players: the Largest Consistent Set," Discussion Papers 09/34, Department of Economics, University of York.
  • Handle: RePEc:yor:yorken:09/34
    as

    Download full text from publisher

    File URL: https://www.york.ac.uk/media/economics/documents/discussionpapers/2009/0934.pdf
    File Function: Main text
    Download Restriction: no

    References listed on IDEAS

    as
    1. Dutta, Bhaskar & Ghosal, Sayantan & Ray, Debraj, 2005. "Farsighted network formation," Journal of Economic Theory, Elsevier, vol. 122(2), pages 143-164, June.
    2. Page Jr., Frank H. & Wooders, Myrna, 2009. "Strategic basins of attraction, the path dominance core, and network formation games," Games and Economic Behavior, Elsevier, vol. 66(1), pages 462-487, May.
    3. Gilles Grandjean & Ana Mauleon & Vincent Vannetelbosch, 2011. "Connections Among Farsighted Agents," Journal of Public Economic Theory, Association for Public Economic Theory, vol. 13(6), pages 935-955, December.
    4. Jackson, Matthew O. & van den Nouweland, Anne, 2005. "Strongly stable networks," Games and Economic Behavior, Elsevier, vol. 51(2), pages 420-444, May.
    5. 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.
    6. Herings, P. Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2009. "Farsightedly stable networks," Games and Economic Behavior, Elsevier, vol. 67(2), pages 526-541, November.
    7. Bloch, Francis & Dutta, Bhaskar, 2009. "Communication networks with endogenous link strength," Games and Economic Behavior, Elsevier, vol. 66(1), pages 39-56, May.
    8. Akihiro Suzuki & Shigeo Muto, 2005. "Farsighted Stability in an n-Person Prisoner’s Dilemma," International Journal of Game Theory, Springer;Game Theory Society, vol. 33(3), pages 431-445, September.
    9. Dutta, Bhaskar & Mutuswami, Suresh, 1997. "Stable Networks," Journal of Economic Theory, Elsevier, vol. 76(2), pages 322-344, October.
      • Dutta, Bhaskar & Mutuswami, Suresh, 1996. "Stable Networks," Working Papers 971, California Institute of Technology, Division of the Humanities and Social Sciences.
    10. Masuda, Takeshi, 2002. "Farsighted stability in average return games," Mathematical Social Sciences, Elsevier, vol. 44(2), pages 169-181, November.
    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. Herings, P. Jean-Jacques & Mauleon, Ana & Vannetelbosch, Vincent, 2009. "Farsightedly stable networks," Games and Economic Behavior, Elsevier, vol. 67(2), pages 526-541, November.
    2. Mariya Teteryatnikova, 2015. "Cautious Farsighted Stability in Network Formation Games with Streams of Payoffs," Vienna Economics Papers 1509, University of Vienna, Department of Economics.

    More about this item

    Keywords

    networks; farsighted; largest consistent set;

    JEL classification:

    • C71 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Cooperative Games
    • D20 - Microeconomics - - Production and Organizations - - - General

    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:yor:yorken:09/34. 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: (Paul Hodgson). General contact details of provider: http://edirc.repec.org/data/deyoruk.html .

    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 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.

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

    IDEAS is a RePEc service hosted by the Research Division of the Federal Reserve Bank of St. Louis . RePEc uses bibliographic data supplied by the respective publishers.