We study the design of profit maximizing single unit auctions under the assumptions that (i) the bidders’ values are correlated and (ii) the seller needs to incur search costs when contacting prospective bidders. We show that although in general, the seller cannot fully extract the social surplus as in the case without search costs, it is nontheless possible to construct a search mechanism that will fully extract the surplus with an arbitrarily high probabilit
This paper examines simultaneous search behavior of a firm for the highest selling price and the low...
The seminal work of Myerson (Mathematics of OR ’81) characterizes incentive-compatible single-item a...
<p>Cremer and McLean 1985 shows that if buyers valuations are suciently correlated, there is a mecha...
We study the design of profit maximizing single unit auctions under the assumptions that (i) the bid...
This article studies a seller's compound search for bidders by a deadline. We show that the optimal ...
179 pagesAlgorithmic mechanism design is an interdisciplinary field, concerned with the design of al...
A seller wants to allocate an indivisible product among a number of potential buyers by a finite de...
We characterize revenue maximizing mechanisms in a common value environment where the value of the o...
In a market in which sellers compete by posting mechanisms, we study how the properties of the meeti...
We characterize optimal selling mechanisms in auction environments where bidders must incur a cost t...
Sponsored search auctions have attracted much research attention in recent years and different equil...
This paper considers auction environments with a (possibly correlated) common prior over bidders' va...
Potential bidders respond to a sellerfs choice of auction mechanism for a common-value or affiliated...
In this paper, we develop a general auction model in which buyers and seller are risk averse and pri...
The seminal work of Myerson (Mathematics of OR ’81) characterizes incentive-compatible single-item a...
This paper examines simultaneous search behavior of a firm for the highest selling price and the low...
The seminal work of Myerson (Mathematics of OR ’81) characterizes incentive-compatible single-item a...
<p>Cremer and McLean 1985 shows that if buyers valuations are suciently correlated, there is a mecha...
We study the design of profit maximizing single unit auctions under the assumptions that (i) the bid...
This article studies a seller's compound search for bidders by a deadline. We show that the optimal ...
179 pagesAlgorithmic mechanism design is an interdisciplinary field, concerned with the design of al...
A seller wants to allocate an indivisible product among a number of potential buyers by a finite de...
We characterize revenue maximizing mechanisms in a common value environment where the value of the o...
In a market in which sellers compete by posting mechanisms, we study how the properties of the meeti...
We characterize optimal selling mechanisms in auction environments where bidders must incur a cost t...
Sponsored search auctions have attracted much research attention in recent years and different equil...
This paper considers auction environments with a (possibly correlated) common prior over bidders' va...
Potential bidders respond to a sellerfs choice of auction mechanism for a common-value or affiliated...
In this paper, we develop a general auction model in which buyers and seller are risk averse and pri...
The seminal work of Myerson (Mathematics of OR ’81) characterizes incentive-compatible single-item a...
This paper examines simultaneous search behavior of a firm for the highest selling price and the low...
The seminal work of Myerson (Mathematics of OR ’81) characterizes incentive-compatible single-item a...
<p>Cremer and McLean 1985 shows that if buyers valuations are suciently correlated, there is a mecha...