This paper shows that the set of probability distributions over networks induced by Nash equilibria of the network formation game proposed by Myerson (1991) is finite for a generic assignment of payoffs to networks. The same result can be extended to several variations of the game found in the literature.
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
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
Publisher Info
Paper provided by School of Economics, The University of New South Wales in its series Discussion Papers with number
2007-31.
Find related papers by JEL classification: C62 - Mathematical and Quantitative Methods - - Mathematical Methods and Programming - - - Existence and Stability Conditions of Equilibrium C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games D85 - Microeconomics - - Information, Knowledge, and Uncertainty - - - Network Formation L14 - Industrial Organization - - Market Structure, Firm Strategy, and Market Performance - - - Transactional Relationships; Contracts and Reputation
This paper has been announced in the following NEP Reports:
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: