With a laboratory experiment, we study the impact of buy-options and the corresponding buy-price on revenues and bidding behavior in (online) proxy-auctions with independent private valuations. We show that temporary buy-options may reduce revenues for two reasons: At low buy-prices, the...

We characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of bidders' independent signals. The optimal mechanism exhibits either neutral selection, wherein the object is randomly allocated at a price that all bidders are...

In contexts in which players have no priors, we analyze a learning process based on ex-post regret as a guide to understand how to play games of incomplete information under private values. The conclusions depend on whether players interact within a fixed set (fixed matching) or they are...

We analyze the doping behavior of heterogeneous athletes in an environment of private information. In a n-player strategic game, modeled as an all-pay auction, each athlete has private information about his actual physical ability and choses the amount of performance-enhancing drugs. The use of...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...

Potential bidders respond to a seller's choice of auction mechanism for a common-value or affiliated-values asset by endogenous decisions whether to incur an information-acquisition cost (and observe a private estimate), or forgo competing. Privately informed participants decide whether to incur...

We address the scheduling problem of reordering an existing queue into its efficient order through trade. To that end, we consider individually rational and balanced budget direct and indirect mechanisms. We show that this class of mechanisms allows us to form efficient queues provided that...

A single unit of a good is to be sold by auction to one of two buyers. The good has either a high value or a low value, with known prior probabilities. The designer of the auction knows the prior over values but is uncertain about the correct model of the buyers' beliefs. The designer evaluates...

We study auction design when bidders have a pure common value equal to the maximum of their independent signals. In the revenue maximizing mechanism, each bidder makes a payment that is independent of his signal and the allocation discriminates in favor of bidders with lower signals. We provide...

We characterize revenue maximizing mechanisms in a common value environment where the value of the object is equal to the highest of bidders’ independent signals. If the object is optimally sold with probability one, then the optimal mechanism is simply a posted price, with the highest...