Revealed Preference Tests of Network Formation Models
This paper proposes a revealed preference test of network formation models. Specifically, I consider network formation models where agents are (1) strategic, (2) externalities are confined to within an agentâ€™s k-neighborhood, where k can be varied. I show that this model can be tested using observation of a single network. I then derive necessary and sufficient condition under which the observed network is consistent with our strategic models of network formation. This non-parametric test takes the form of an algorithm involving the computation of color-preserving automorphisms of graphs. Building on the theoretical result, the test is implemented to calculate itsâ€™ statistical power and to the Banerjee et al. (2012)â€™s social network data.
When requesting a correction, please mention this item's handle: RePEc:net:wpaper:1323. 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: (Nicholas Economides)
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 references are entirely missing, you can add them using this form.
If the full references list an item that is present in RePEc, but the system did not link 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 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.