IDEAS home Printed from https://ideas.repec.org/a/eee/matsoc/v56y2008i2p283-295.html
   My bibliography  Save this article

Position-specific information in social networks: Are you connected?

Author

Listed:
  • McBride, Michael

Abstract

Individuals in social networks often imperfectly monitor others' network relationships and have incomplete information about the value of forming new relationships. This paper introduces the Generalized Conjectural Equilibrium (GCE) concept for such settings and completely characterizes the set of GCE networks when players observe only local parts of the network. Incomplete information and imperfect monitoring generate different types of inefficiency. These inefficiencies increase in number and scope as network observation becomes more localized. These results suggest that actual social networks will be structured inefficiently in general.

Suggested Citation

  • McBride, Michael, 2008. "Position-specific information in social networks: Are you connected?," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 283-295, September.
  • Handle: RePEc:eee:matsoc:v:56:y:2008:i:2:p:283-295
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0165-4896(08)00047-4
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to look for a different version below or search for a different version of it.

    Other versions of this item:

    References listed on IDEAS

    as
    1. Rubinstein Ariel & Wolinsky Asher, 1994. "Rationalizable Conjectural Equilibrium: Between Nash and Rationalizability," Games and Economic Behavior, Elsevier, vol. 6(2), pages 299-311, March.
    2. Gilli, Mario, 1999. "On Non-Nash Equilibria," Games and Economic Behavior, Elsevier, vol. 27(2), pages 184-203, May.
    3. Fudenberg, Drew & Levine, David K, 1993. "Self-Confirming Equilibrium," Econometrica, Econometric Society, vol. 61(3), pages 523-545, May.
    4. McBride Michael, 2006. "Limited Observation in Mutual Consent Networks," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 6(1), pages 1-31, August.
    5. Galeotti, Andrea & Goyal, Sanjeev & Kamphorst, Jurjen, 2006. "Network formation with heterogeneous players," Games and Economic Behavior, Elsevier, vol. 54(2), pages 353-372, February.
    6. McBride, Michael, 2006. "Imperfect monitoring in communication networks," Journal of Economic Theory, Elsevier, vol. 126(1), pages 97-119, January.
    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. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2011. "Strict Nash networks and partner heterogeneity," International Journal of Game Theory, Springer;Game Theory Society, vol. 40(3), pages 515-525, August.
    2. Gilles, R.P. & Sarangi, S., 2003. "The Role of Trust in Costly Network Formation," Discussion Paper 2003-53, Tilburg University, Center for Economic Research.
    3. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2013. "Modeling resource flow asymmetries using condensation networks," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 41(3), pages 537-549, September.
    4. Pascal Billand & Christophe Bravard & Sudipta Sarangi, 2011. "Resources Flows Asymmetries in Strict Nash Networks with Partner Heterogeneity," Post-Print halshs-00574256, HAL.
    5. Goeree, Jacob K. & Riedl, Arno & Ule, Aljaz, 2009. "In search of stars: Network formation among heterogeneous agents," Games and Economic Behavior, Elsevier, vol. 67(2), pages 445-466, November.
    6. Haller, Hans & Sarangi, Sudipta, 2005. "Nash networks with heterogeneous links," Mathematical Social Sciences, Elsevier, vol. 50(2), pages 181-201, September.
    7. Hans Haller & Sudipta Sarangi, 2003. "Nash Networks with Heterogeneous Agents," Discussion Papers of DIW Berlin 337, DIW Berlin, German Institute for Economic Research.
    8. Matthew O. Jackson, 2003. "A Survey of Models of Network Formation: Stability and Efficiency," Game Theory and Information 0303011, University Library of Munich, Germany.
    9. Michael Caldara & Michael McBride, 2014. "An Experimental Study of Network Formation with Limited Observation," Working Papers 141501, University of California-Irvine, Department of Economics.
    10. Safi, Shahir, 2022. "Listen before you link: Optimal monitoring rules for communication networks," Games and Economic Behavior, Elsevier, vol. 133(C), pages 230-247.
    11. Gallo Edoardo, 2012. "Small World Networks with Segregation Patterns and Brokers," Review of Network Economics, De Gruyter, vol. 11(3), pages 1-46, September.

    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. Foerster, Manuel & Mauleon, Ana & Vannetelbosch, Vincent J., 2021. "Shadow links," Journal of Economic Theory, Elsevier, vol. 197(C).
      • FOERSTER Manuel, & MAULEON Ana, & VANNETELBOSCH Vincent,, 2018. "Shadow links," LIDAM Discussion Papers CORE 2018030, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
      • Foerster, Manuel & Mauleon, Ana & Vannetelbosch, Vincent, 2021. "Shadow links," LIDAM Reprints CORE 3171, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    2. Antoni Rubi-Barcelo, 2013. "Categorical Segregation from a Game Theoretical Approach," Annals of Economics and Finance, Society for AEF, vol. 14(1), pages 85-120, May.
    3. Schipper, Burkhard C., 2021. "Discovery and equilibrium in games with unawareness," Journal of Economic Theory, Elsevier, vol. 198(C).
    4. Azrieli, Yaron, 2009. "Categorizing others in a large game," Games and Economic Behavior, Elsevier, vol. 67(2), pages 351-362, November.
    5. Yaron Azrieli, 2009. "On pure conjectural equilibrium with non-manipulable information," International Journal of Game Theory, Springer;Game Theory Society, vol. 38(2), pages 209-219, June.
    6. Giacomo Bonanno, 2021. "Rational play in games: A behavioral approach," Working Papers 344, University of California, Davis, Department of Economics.
    7. Agnieszka Wiszniewska-Matyszkiel, 2016. "Belief distorted Nash equilibria: introduction of a new kind of equilibrium in dynamic games with distorted information," Annals of Operations Research, Springer, vol. 243(1), pages 147-177, August.
    8. Mario Gilli, 2002. "Rational Learning in Imperfect Monitoring Games," Working Papers 46, University of Milano-Bicocca, Department of Economics, revised Mar 2002.
    9. Dekel, Eddie & Fudenberg, Drew & Levine, David K., 2004. "Learning to play Bayesian games," Games and Economic Behavior, Elsevier, vol. 46(2), pages 282-303, February.
    10. Péter Bayer & Ani Guerdjikova, 2020. "Optimism leads to optimality: Ambiguity in network formation," Working Papers hal-03005107, HAL.
    11. Macault, Emilien & Scarsini, Marco & Tomala, Tristan, 2022. "Social learning in nonatomic routing games," Games and Economic Behavior, Elsevier, vol. 132(C), pages 221-233.
    12. Michael Caldara & Michael McBride, 2014. "An Experimental Study of Network Formation with Limited Observation," Working Papers 141501, University of California-Irvine, Department of Economics.
    13. Safi, Shahir, 2022. "Listen before you link: Optimal monitoring rules for communication networks," Games and Economic Behavior, Elsevier, vol. 133(C), pages 230-247.
    14. Joseph Greenberg, 2000. "The Right to Remain Silent," Theory and Decision, Springer, vol. 48(2), pages 193-204, March.
    15. Olaizola, Norma & Valenciano, Federico, 2013. "Network formation under linking constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(20), pages 5194-5205.
    16. Battigalli, Pierpaolo & Panebianco, Fabrizio & Pin, Paolo, 2023. "Learning and selfconfirming equilibria in network games," Journal of Economic Theory, Elsevier, vol. 212(C).
    17. Cerreia-Vioglio, Simone & Maccheroni, Fabio & Schmeidler, David, 2022. "Equilibria of nonatomic anonymous games," Games and Economic Behavior, Elsevier, vol. 135(C), pages 110-131.
    18. Kalai, Ehud & Lehrer, Ehud, 1995. "Subjective games and equilibria," Games and Economic Behavior, Elsevier, vol. 8(1), pages 123-163.
    19. Heller, Yuval, 2012. "Justifiable choice," Games and Economic Behavior, Elsevier, vol. 76(2), pages 375-390.
    20. Dekel, Eddie & Fudenberg, Drew & Levine, David K., 1999. "Payoff Information and Self-Confirming Equilibrium," Journal of Economic Theory, Elsevier, vol. 89(2), pages 165-185, December.

    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:eee:matsoc:v:56:y:2008:i:2:p:283-295. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/inca/505565 .

    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.