IDEAS home Printed from https://ideas.repec.org/a/wly/emetrp/v86y2018i1p263-288.html

Identifying Preferences in Networks With Bounded Degree

Author

Listed:
  • Ã ureo de Paula
  • Seth Richards†Shubik
  • Elie Tamer

Abstract

This paper provides a framework for identifying preferences in a large network where links are pairwise stable. Network formation models present difficulties for identification, especially when links can be interdependent, for example, when indirect connections matter. We show how one can use the observed proportions of various local network structures to learn about the underlying preference parameters. The key assumption for our approach restricts individuals to have bounded degree in equilibrium, implying a finite number of payoff†relevant local structures. Our main result provides necessary conditions for parameters to belong to the identified set. We then develop a quadratic programming algorithm that can be used to construct this set. With further restrictions on preferences, we show that our conditions are also sufficient for pairwise stability and therefore characterize the identified set precisely. Overall, the use of both the economic model along with pairwise stability allows us to obtain effective dimension reduction.

Suggested Citation

  • à ureo de Paula & Seth Richards†Shubik & Elie Tamer, 2018. "Identifying Preferences in Networks With Bounded Degree," Econometrica, Econometric Society, vol. 86(1), pages 263-288, January.
    • Handle: RePEc:wly:emetrp:v:86:y:2018:i:1:p:263-288
    DOI: 10.3982/ECTA13564
    as

    Download full text from publisher

    File URL: https://doi.org/10.3982/ECTA13564
    Download Restriction: no
    File URL: https://libkey.io/10.3982/ECTA13564?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Other versions of this item:

    More about this item

    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:wly:emetrp:v:86:y:2018:i:1:p:263-288. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Wiley Content Delivery (email available below). General contact details of provider: https://edirc.repec.org/data/essssea.html .

    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.