Grigorieva Elena Herings P. Jean-Jacques Müller Rudolf Vermeulen Dries (METEOR)
Abstract
Query auctions are iterative auctions in which bidders have to select in each round an action from a finite set. We show that, when bidders have continuous valuations, any ex post equilibrium in an ex post individually rational query auction can only be ex post efficient when the running time of the auction is infinite for almost all realizations of valuations of thebidders. Thus, when valuations are drawn from a continuous probability distribution, efficiency can only be bought at the expense of a running time that is infinite with probability one. For two bidders we even show this to be true when we only require efficiency with probability one.
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 Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization in its series Research Memoranda with number
023.
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.: