A competition authority has an objective, which specifies what output profile firms need to produce as a function of production costs. These costs change over time and are only known by the firms. The objective is implementable if inequilibrium, the firms cannot collude on their reports to the...

This paper proposes a general competing mechanism game of incomplete information where a mechanism allows its designer to send a message to himself at the same time agents send messages. This paper introduces a notion of robust equilibrium. If each agent’s payoff function is separable with...

We define and characterize a notion of correlated equilibrium for games with incomplete information, which we call Bayes correlated equilibrium: The set of outcomes that can arise in Bayes Nash equilibria of an incomplete information game where players may have access to additional signals...

We study the design of sequential procurement strategies that integrate stochastic and strategic information. We consider a buyer who repeatedly demands a certain good and is unable to commit to long-term contracts. In each time period, the buyer makes a price offer to a seller who has private,...

A standard incomplete-information war of attrition is extended to incorporate experimentation and private learning. We obtain a characterization of all equilibria in this extended setup and use this setup to illuminate a tradeoff between short-run and long-run gains of experimentation. The...

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

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 explore the impact of private information in sealed-bid first-price auctions. For a given symmetric and arbitrarily correlated prior distribution over values, we characterize the lowest winning-bid distribution that can arise across all information structures and equilibria. The information...

We explore the impact of private information in sealed bid first price auctions. For a given symmetric and arbitrarily correlated prior distribution over values, we characterize the lowest winning bid distribution that can arise across all information structures and equilibria. The information...