In this paper we present a new iterative auction, the bisection auction, that can be used for the sale of a single indivisable object. We will show that the bisection auction is computationally more efficient than the classical English auction while it still preserves all characteristics the English auction shares with the Vickrey auction there exists an equilibrium in weakly dominant strategies in wich everyone truthfully reveals his information, the object is allocated in accordance with efficiency requirements to the buyer who has the highest valuation, and the price paid by the winner of the object equals the second-highest valuation.
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 Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization in its series Research Memoranda with number
051.
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.:
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.)
Grigorieva Elena & Herings P. Jean-Jacques & Müller Rudolf & Vermeulen Dries, 2007.
"On The Fastest Vickrey Algorithm,"
Research Memoranda
013, Maastricht : METEOR, Maastricht Research School of Economics of Technology and Organization.
[Downloadable!]
Did you know? You can import bibliographic info in various formats into you bibliographic tool, or just into your word processor. See under "publisher info" on each abstract page.