We consider a private-value auction with one-sided incomplete information in which two objects are sold in a sequence of two second-price auctions. The buyers have multiunit demand and are asymmetrically informed at the ex ante stage of the game. One buyer perfectly knows his type, and the other...

This paper shows that a monopolistic certifying party can have incentives to disclose revealing information about the agent he is certifying. Using a three-person game-theoretic model and allowing certificate users (buyers) to have noisy estimates of the quality level of the agent being...

I model access to influence as a two-sided matching market between a continuum of experts and a finite number of gatekeepers under sequential directed search. Real-world examples include academic publishing, venture capitalism or political agenda setting. Uniqueness of the resulting equilibrium...

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

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

We consider a general mechanism design setting where each agent can acquire covert information before participating in the mechanism. The central question is whether a mechanism exists which provides the efficient incentives for information acquisition ex-ante and implements the efficient...

A seller wishes to sell an object to one of multiple bidders. The valuations of the bidders are privately known. We consider the joint design problem in which the seller can decide the accuracy by which bidders learn their valuation and to whom to sell at what price. We establish that optimal...

Blockchain implementations of auctions have to deal with the problem of front-running: block production happens at discrete intervals, and anyone can inspect and react to the incoming bids before they are written on chain. The presence of smart contracts among bidders, a hallmark of automated...

After the close of an auction, the winning bidder may find that he is unable to carry out his bid offer. This paper seeks to determine what measures the seller should take to maximize his share of the surplus when bidders are privately informed about their risk of default. Special attention is...