We study a class of single-round, sealed-bid auctions for an item in unlimited supply, such as a digital good. We introduce the notion of competitive auctions. A competitive auction is truthful (i.e. encourages bidders to bid their true valuations) and on all inputs yields profit that is within a constant factor of the profit of the optimal single sale price. We justify the use of optimal single price profit as a benchmark for evaluating a competitive auctions profit. We exhibit several randomized competitive auctions and show that there is no symmetric deterministic competitive auction. Our results extend to bounded supply markets, for which we also give competitive auctions
AbstractThis paper studies auctions in a setting where the different bidders arrive at different tim...
We study revenue maximization for digital auctions, where there are infinitely many copies of a good...
Auctions are widely used online to conduct commercial transactions. An important feature of online a...
We study a class of single-round, sealed-bid auctions for items in unlimited supply, such as digital...
This paper investigates a new auction model in which bidders have both copy and budget constraints. ...
Abstract In this paper we consider the problem of designing a mechanism for double auctions where bi...
AbstractThis paper investigates a new auction model in which bidders have both copy and budget const...
this paper we study auctions, which are an important class of mechanisms. We consider auctions for a...
In this paper, a competitive distribution of auctions is described for an economy consisting of an i...
The auction of an object is considered, for the case in which one bidder is better-informed than the...
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids ...
We derive equilibrium bidding strategies in divisible good auctions for asymmetrically informed risk...
The two most prominent forms of sealed-bid auctions are the discriminative pricing rule and the one...
We describe mechanisms for auctions that are simultaneously truthful (alternately known as strategy-...
This thesis concerns the interdisciplinary field of combinatorial auctions, combining the fields of ...
AbstractThis paper studies auctions in a setting where the different bidders arrive at different tim...
We study revenue maximization for digital auctions, where there are infinitely many copies of a good...
Auctions are widely used online to conduct commercial transactions. An important feature of online a...
We study a class of single-round, sealed-bid auctions for items in unlimited supply, such as digital...
This paper investigates a new auction model in which bidders have both copy and budget constraints. ...
Abstract In this paper we consider the problem of designing a mechanism for double auctions where bi...
AbstractThis paper investigates a new auction model in which bidders have both copy and budget const...
this paper we study auctions, which are an important class of mechanisms. We consider auctions for a...
In this paper, a competitive distribution of auctions is described for an economy consisting of an i...
The auction of an object is considered, for the case in which one bidder is better-informed than the...
We consider the problem of revenue maximization in online auctions, that is, auctions in which bids ...
We derive equilibrium bidding strategies in divisible good auctions for asymmetrically informed risk...
The two most prominent forms of sealed-bid auctions are the discriminative pricing rule and the one...
We describe mechanisms for auctions that are simultaneously truthful (alternately known as strategy-...
This thesis concerns the interdisciplinary field of combinatorial auctions, combining the fields of ...
AbstractThis paper studies auctions in a setting where the different bidders arrive at different tim...
We study revenue maximization for digital auctions, where there are infinitely many copies of a good...
Auctions are widely used online to conduct commercial transactions. An important feature of online a...