This paper studies sequential auctions of licences to operate in a market where those firms that obtain at least one licence then engage in a symmetric market game. I employ a new refinement of Nash equilibrium, the concept of {\sl Markovian recursively undominated equilibrium}. The unique solution satisfies the following properties: (i) when several firms own licences before the auction (incumbents), new entrants buy licences in each stage, and (ii) when there is no more than one incumbent, either the single firm preempts entry altogether or entry occurs in every stage, depending on the parameter configuration.
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 Department of Economics and Business, Universitat Pompeu Fabra in its series Economics Working Papers with number
209.
Find related papers by JEL classification: D44 - Microeconomics - - Market Structure and Pricing - - - Auctions C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
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.:
Robert J. Weber, 1981.
"Multiple-Object Auctions,"
Discussion Papers
496, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
[Downloadable!]
Cited by: (explanations, 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.)