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...

Two types of auction were introduced on the Internet a few years ago and have rapidly been gaining widespread popularity. In both auctions, players compete for an exogenously determined prize by independently choosing an integer in some finite and common strategy space specified by the...

We characterize the set of perfect Bayesian equilibria in symmetric separating strategies in Milgrom and Weber's (1982) model of English auctions. There is a continuum of such equilibria. The equilibrium derived by Milgrom and Weber is that in which bids are maximal. Only in the case of pure...

This paper studies the degrees of equilibrium competition in three common forms of auctions with costly participation, and shows that, when bidders' valuation distribution is concave, there is a simple condition to rank the equilibrium competition of those auctions. It also investigates how the...

The experimental evidence from three prominent auction trading institutions: (1) the continuous double auction, (2) the uniform-price sealed bid-offer auction, and (3) the uniform-price double auction (with continuous feedback of real time information on the acceptance status of bids and...