Stephen Morris Publications

We propose an incomplete information analogue of rationalizability. An action is said to be belief-free rationalizable if it survives the following iterated deletion process. At each stage, we delete actions for a type of a player that are not a best response to some conjecture that puts weight only on profiles of types of other players and states that that type thinks possible, combined with actions of those types that have survived so far. We describe a number of applications.
This solution concept characterizes the implications of equilibrium when a player is known to have some private information but may have additional information. It thus answers the “informational robustness” question of what can we say about the set of outcomes that may arise in equilibrium of a Bayesian game if players may observe some additional information.

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 a necessary and sufficient condition under which the optimal mechanism reduces to a posted price under which all bidders are equally likely to get the good. This model of pure common values can equivalently be interpreted as model of resale: the bidders have independent private values at the auction stage, and the winner of the auction can make a take-it-or-leave-it-offer in the secondary market under complete information.

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 a given auction design by the lowest expected revenue that would be generated across all models of buyers’ information that are consistent with the common prior and across all Bayesian equilibria. An optimal auction for such a seller is constructed, as is a worst-case model of buyers’ information. The theory generates upper bounds on the seller’s optimal payoff for general many-player and common-value models.

A set of players have preferences over a set of outcomes. We consider the problem of an “information designer” who can choose an information structure for the players to serve his ends, but has no ability to change the mechanism (or force the players to make particular action choices). We describe a unifying perspective for information design. We consider a simple example of Bayesian persuasion with both an uninformed and informed receiver. We extend information design to many players and relate it to the literature on incomplete information correlated equilibrium.

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 and equilibrium attaining this minimum leave bidders uncertain whether they will win or lose and indifferent between their equilibrium bids and all higher bids. Our results provide lower bounds for bids and revenue with asymmetric distributions over values.

We report further analytic and computational characterizations of revenue and bidder surplus including upper bounds on revenue. Our work has implications for the identification of value distributions from winning bid data and for the informationally robust comparison of alternative bidding mechanisms.

This paper explores the consequences of information in sealed bid first price auctions. For a given symmetric and arbitrarily correlated prior distribution over valuations, we characterize the set of possible outcomes that can arise in a Bayesian equilibrium for some information structure. In particular, we characterize maximum and minimum revenue across all information structures when bidders may not know their own values, and maximum revenue when they do know their values. Revenue is maximized when buyers know who has the highest valuation, but the highest valuation buyer has partial information about others’ values. Revenue is minimized when buyers are uncertain about whether they will win or lose and incentive constraints are binding for all upward bid deviations.

We provide further analytic results on possible welfare outcomes and report computational methods which work when we do not have analytic solutions. Many of our results generalize to asymmetric value distributions. We apply these results to study how entry fees and reserve prices impact the welfare bounds.

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 and equilibrium attaining this minimum leave bidders indifferent between their equilibrium bids and all higher bids. Our results provide lower bounds for bids and revenue with asymmetric distributions over values.

We report further analytic and computational characterizations of revenue and bidder surplus including upper bounds on revenue. Our work has implications for the identification of value distributions from data on winning bids and for the informationally robust comparison of alternative bidding mechanisms.

We analyze demand function competition with a finite number of agents and private information. We show that the nature of the private information determines the market power of the agents and thus price and volume of equilibrium trade.

We establish our results by providing a characterization of the set of all joint distributions over demands and payoff states that can arise in equilibrium under any information structure. In demand function competition, the agents condition their demand on the endogenous information contained in the price.

We compare the set of feasible outcomes under demand function to the feasible outcomes under Cournot competition. We find that the first and second moments of the equilibrium distribution respond very differently to the private information of the agents under these two market structures. The first moment of the equilibrium demand, the average demand, is more sensitive to the nature of the private information in demand function competition, reflecting the strategic impact of private information. By contrast, the second moments are less sensitive to the private information, reflecting the common conditioning on the price among the agents.

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 and equilibrium attaining this minimum leave bidders indifferent between their equilibrium bids and all higher bids. Our results provide lower bounds for bids and revenue with asymmetric distributions over values. We also report further characterizations of revenue and bidder surplus including upper bounds on revenue. Our work has implications for the identification of value distributions from data on winning bids and for the informationally robust comparison of alternative bidding mechanisms.

We consider demand function competition with a finite number of agents and private information. We analyze how the structure of the private information shapes the market power of each agent and the price volatility. We show that any degree of market power can arise in the unique equilibrium under an information structure that is arbitrarily close to complete information. In particular, regardless of the number of agents and the correlation of payoff shocks, market power may be arbitrarily close to zero (so we obtain the competitive outcome) or arbitrarily large (so there is no trade in equilibrium). By contrast, price volatility is always less than the variance of the aggregate shock across agents across all information structures, hence we can provide sharp and robust bounds on some but not all equilibrium statistics.

We then compare demand function competition with a different uniform price trading mechanism, namely Cournot competition. Interestingly, in Cournot competition, the market power is uniquely determined while the price volatility cannot be bounded by the variance of the aggregate shock.

We discuss four solution concepts for games with incomplete information. We show how each solution concept can be viewed as encoding informational robustness. For a given type space, we consider expansions of the type space that provide players with additional signals. We distinguish between expansions along two dimensions. First, the signals can either convey payoff relevant information or only payoff irrelevant information. Second, the signals can be generated from a common (prior) distribution or not. We establish the equivalence between Bayes Nash equilibrium behavior under the resulting expansion of the type space and a corresponding more permissive solution concept under the original type space. This approach unifies some existing literature and, in the case of an expansion without a common prior and allowing for payoff relevant signals, leads us to a new solution concept that we dub belief-free rationalizability.