Explore the vast range of titles available.

A strategy is obviously dominant if, for any deviation, at any information set where both strategies first diverge, the best outcome under the deviation is no better than the worst outcome under the dominant strategy. A mechanism is obviously strategy-proof (OSP) if it has an equilibrium in obviously dominant strategies. This has a behavioral interpretation: a strategy is obviously dominant if and only if a cognitively limited agent can recognize it as weakly dominant. It also has a classical interpretation: a choice rule is OSP-implementable if and only if it can be carried out by a social planner under a particular regime of partial commitment.

This paper constructs an efficient, budget-balanced, Bayesian incentive-compatible mechanism for a general dynamic environment with quasilinear payoffs in which agents observe private information and decisions are made over countably many periods. First, under the assumption of \"private values\" (other agents' private information does not directly affect an agent's payoffs), we construct an efficient, ex post incentive-compatible mechanism, which is not budget-balanced. Second, under the assumption of \"independent types\" (the distribution of each agent's private information is not directly affected by other agents' private information), we show how the budget can be balanced without compromising agents' incentives. Finally, we show that the mechanism can be made self-enforcing when agents are sufficiently patient and the induced stochastic process over types is an ergodic finite Markov chain.

Crowdfunding provides innovation in enabling entrepreneurs to contract with consumers before investment. Under aggregate demand uncertainty, this improves screening for valuable projects. Entrepreneurial moral hazard and private cost information threatens this benefit. Crowdfunding's after-markets enable consumers to actively implement deferred payments and thereby manage moral hazard. Popular crowdfunding platforms offer schemes that allow consumers to do so through conditional pledging behavior. Efficiency is sustainable only if expected returns exceed an agency cost associated with the entrepreneurial incentive problems. By reducing demand uncertainty, crowdfunding promotes welfare and complements traditional entrepreneurial financing, which focuses on controlling moral hazard.

We characterize optimal mechanisms for the multiple-good monopoly problem and provide a framework to find them. We show that a mechanism is optimal if and only if a measure µ derived from the buyer's type distribution satisfies certain stochastic dominance conditions. This measure expresses the marginal change in the seller's revenue under marginal changes in the rent paid to subsets of buyer types. As a corollary, we characterize the optimality of grand-bundling mechanisms, strengthening several results in the literature, where only sufficient optimality conditions have been derived. As an application, we show that the optimal mechanism for n independent uniform items each supported on [c, c + 1] is a grand-bundling mechanism, as long as c is sufficiently large, extending Pavlov's result for two items Pavlov (2011). At the same time, our characterization also implies that, for all c and for all sufficiently large n, the optimal mechanism for n independent uniform items supported on [c, c + 1] is not a grand-bundling mechanism.

We study persuasion mechanisms in linear environments. A receiver has a private type and chooses between two actions. A sender designs a persuasion mechanism or an experiment to disclose information about a payoff-relevant state. A persuasion mechanism conditions information disclosure on the receiver's report about his type, whereas an experiment discloses information independent of the receiver's type. We establish the equivalence of implementation by persuasion mechanisms and by experiments, and characterize optimal persuasion mechanisms.

A seller designs a mechanism to sell a single object to a potential buyer whose private type is his incomplete information about his valuation. The seller can disclose additional information to the buyer about his valuation without observing its realization. In both discrete-type and continuous-type settings, we show that discriminatory disclosure—releasing different amounts of additional information to different buyer types—dominates full disclosure in terms of seller revenue. An implication is that the orthogonal decomposition technique, while an important tool in dynamic mechanism design, is generally invalid when information disclosure is part of the design.

We develop a tool akin to the revelation principle for dynamic mechanism-selection games in which the designer can only commit to short-term mechanisms. We identify a canonical class of mechanisms rich enough to replicate the outcomes of any equilibrium in a mechanism-selection game between an uninformed designer and a privately informed agent. A cornerstone of our methodology is the idea that a mechanism should encode not only the rules that determine the allocation, but also the information the designer obtains from the interaction with the agent. Therefore, how much the designer learns, which is the key tension in design with limited commitment, becomes an explicit part of the design. Our result simplifies the search for the designer-optimal outcome by reducing the agent’s behavior to a series of participation, truth telling, and Bayes’ plausibility constraints the mechanisms must satisfy.

Consider an extensive-form mechanism, run by an auctioneer who communicates sequentially and privately with bidders. Suppose the auctioneer can deviate from the rules provided that no single bidder detects the deviation. A mechanism is credible if it is incentive-compatible for the auctioneer to follow the rules. We study the optimal auctions in which only winners pay, under symmetric independent private values. The first-price auction is the unique credible static mechanism. The ascending auction is the unique credible strategy-proof mechanism.

We characterize the set of extreme points of monotonic functions that are either majorized by a given function f or themselves majorize f and show that these extreme points play a crucial role in many economic design problems. Our main results show that each extreme point is uniquely characterized by a countable collection of intervals. Outside these intervals the extreme point equals the original function f and inside the function is constant. Further consistency conditions need to be satisfied pinning down the value of an extreme point in each interval where it is constant. We apply these insights to a varied set of economic problems: equivalence and optimality of mechanisms for auctions and (matching) contests, Bayesian persuasion, optimal delegation, and decision making under uncertainty.

We survey a recent and growing literature on markets for information. We offer a comprehensive view of information markets through an integrated model of consumers, information intermediaries, and firms. The model embeds a large set of applications ranging from sponsored-search advertising to credit scores to information sharing among competitors. We then zoom in to one of the critical elements in the markets for information: the design of the information. We distinguish between ex ante sales of information (the buyer acquires an information structure) and ex post sales (the buyer pays for specific realizations). We relate this distinction to the different products that brokers, advertisers, and publishers use to trade consumer information online. We discuss the endogenous limits to the trade of information that derive from the potential adverse use of information to the consumers. Finally, we discuss recommender systems and other information filtering systems that use artificial intelligence to predict ratings or preferences in markets for indirect information.