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

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 timeof the auction is infinite for almost all realizations of valuations of the bidders. We also show that this result...

In this paper we analyze the performance of a recently proposed sequential auction, called the c-bisection auction, that can be used for a sale of a single indivisible object. We discuss the running time and the e±ciency in the ex-post equilibrium of the auction. We show that by changing the...

In this paper we present a new auction, the bisection auction, that can be used for the sale of a single indivisible object. We discuss the issue concerning the information revelation requirement of this auction and the associated amount of data that needs to be transmitted. We show that in the...

We investigate the algorithmic performance of Vickrey-Clarke-Groves mechanisms in the single item case. We provide a formal definition of a Vickrey algorithm for this framework, and give a number of examples of Vickrey algorithms. We consider three performance criteria, one corresponding to a...

We present a laboratory experiment in which we investigate bidding behavior with independent private values in the recently proposed bisection auction, and compare it with two classical auction formats - the Vickrey auction and the English auction. We test whether subjects behave strategically...

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

This paper studies the sales of a single indivisible object where bidders have continuous valuations. In Grigorieva et al. [14] it was shown that, in this setting, query auctions necessarily allocate inefficiently in equilibrium. In this paper we propose a new sequential auction, called the...

A digital mechanism is defined as an iterative procedure in which bidders select an action, from a finite set, in each iteration. When bidders have continuous valuations and make strategic reports, we show that any ex post implementation of the Vickrey choice rule via such a mechanism needs...

In this paper we present a new auction, the bisection auction, that can be used for the sale of a single indivisible object. We discuss the issue concerning the information revelation requirement of this auction and the associated amount of data that needs to be transmitted. We show that in the...