A network payoff function assigns a utility to all participants in a (social) network. In this paper we discuss properties of such network payoff functions that guarantee the existence of certain types of pairwise stable networks and the convergence of certain network formation processes. In particular we investigate network payoff functions that admit an exact network potential or an ordinal network potential. We relate these network potentials to exact and ordinal potentials of a non-cooperative network formation game based on consent in link formation. Our main results extend and strengthen the current insights in the literature on game theoretic approaches to social network formation.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
file. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by University of Bonn, Germany in its series Bonn Econ Discussion Papers with number
bgse28_2005.
Length: 47 Date of creation: Oct 2005 Date of revision: Handle: RePEc:bon:bonedp:bgse28_2005
Contact details of provider: Postal: Bonn Graduate School of Economics, University of Bonn, Adenauerallee 24 - 26, 53113 Bonn, Germany Fax: +49 228 73 9221 Web page: http://www.bgse.uni-bonn.de/index.php?id=494
For technical questions regarding this item, or to correct its listing, contact: (Daniel Park).
Find related papers by JEL classification: C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games C79 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Other D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation
This paper has been announced in the following NEP Reports: