This paper considers auction environments with a (possibly correlated) common prior over bidders' values, where each bidder may have additional information (e.g., through information acquisition). Under certain conditions, we characterize the optimal mechanisms in terms of the expected revenue that is guaranteed given whatever additional information is available to the bidders. Even if the values are correlated,we do not necessarily have full-surplus extraction, and moreover, the optimal mechanism resembles those in the independently distributed cases. Specifically, we show that (i) a second-price auction is optimal among all the efficient mechanisms, and (ii) it is rate-optimal among all the mechanisms
We study optimal bidder collusion at first-price auctions when the collusive mechanism only relies o...
We study optimal bidder collusion at first-price auctions when the collusive mechanism only relies o...
We analyze the optimal information design in a click-through auction with fixed valuations per click,...
This paper considers auction environments with a (possibly correlated) common prior over bidders' va...
We explore the impact of private information in sealed-bid first-price auctions. For a given symmetri...
We explore the impact of private information in sealed-bid first-price auctions. For a given symmetri...
We consider an auction design problem with private values, where the seller and bidders may enjoy he...
We explore the impact of private information in sealed-bid first-price auctions. For a given symmetri...
We explore the impact of private information in sealed bid first price auctions. For a given symmetri...
We explore the impact of private information in sealed-bid first-price auctions. For a given symmetri...
We explore the impact of private information in sealed bid first price auctions. For a given symmetri...
This paper explores the consequences of information in sealed bid first price auctions. For a given s...
This paper explores the consequences of information in sealed bid first price auctions. For a given s...
In this paper, we develop a general auction model in which buyers and seller are risk averse and pri...
<p>Cremer and McLean 1985 shows that if buyers valuations are suciently correlated, there is a mecha...
We study optimal bidder collusion at first-price auctions when the collusive mechanism only relies o...
We study optimal bidder collusion at first-price auctions when the collusive mechanism only relies o...
We analyze the optimal information design in a click-through auction with fixed valuations per click,...
This paper considers auction environments with a (possibly correlated) common prior over bidders' va...
We explore the impact of private information in sealed-bid first-price auctions. For a given symmetri...
We explore the impact of private information in sealed-bid first-price auctions. For a given symmetri...
We consider an auction design problem with private values, where the seller and bidders may enjoy he...
We explore the impact of private information in sealed-bid first-price auctions. For a given symmetri...
We explore the impact of private information in sealed bid first price auctions. For a given symmetri...
We explore the impact of private information in sealed-bid first-price auctions. For a given symmetri...
We explore the impact of private information in sealed bid first price auctions. For a given symmetri...
This paper explores the consequences of information in sealed bid first price auctions. For a given s...
This paper explores the consequences of information in sealed bid first price auctions. For a given s...
In this paper, we develop a general auction model in which buyers and seller are risk averse and pri...
<p>Cremer and McLean 1985 shows that if buyers valuations are suciently correlated, there is a mecha...
We study optimal bidder collusion at first-price auctions when the collusive mechanism only relies o...
We study optimal bidder collusion at first-price auctions when the collusive mechanism only relies o...
We analyze the optimal information design in a click-through auction with fixed valuations per click,...