We analyze nonlinear pricing with finite information. We consider a multi-product environment where each buyer has preferences over a d-dimensional variety of goods. The seller is limited to offering a finite number n of d-dimensional choices. The limited menu reflects a finite communication capacity between the buyer and seller.
We identify necessary conditions that the optimal finite menu must satisfy, for either the socially efficient or the revenue-maximizing mechanism. These conditions require that information be bundled, or "quantized," optimally. We introduce vector quantization and establish that the losses due to finite menus converge to zero at a rate of 1/n2/d_ In the canonical model with one-dimensional products and preferences, this establishes that the loss resulting from using the n-item menu converges to zero at a rate proportional to 1 /n2 .
We analyze nonlinear pricing with finite information. We consider a multi-product environment where each buyer has preferences over a d-dimensional variety of goods. The seller is limited to offering a finite number n of d-dimensional choices. The limited menu reflects a finite communication capacity between the buyer and seller.
We identify necessary conditions that the optimal finite menu must satisfy, for either the socially efficient or the revenue-maximizing mechanism. These conditions require that information be bundled, or “quantized,” optimally.
We introduce vector quantization and establish that the losses due to finite menus converge to zero at a rate of 1/n2/d. In the canonical model with one-dimensional products and preferences, this establishes that the loss resulting from using the n-item menu converges to zero at a rate proportional to 1/n2.
As large amounts of data become available and can be communicated more easily and processed more e¤ectively, information has come to play a central role for economic activity and welfare in our age. This essay overviews contributions to the industrial organization of information markets and nonmarkets, while attempting to maintain a balance between foundational frameworks and more recent developments. We start by reviewing mechanism-design approaches to modeling the trade of information. We then cover ratings, predictions, and recommender systems. We turn to forecasting contests, prediction markets, and other institutions designed for collecting and aggregating information from decentralized participants. Finally, we discuss science as a prototypical information nonmarket with participants who interact in a non-anonymous way to produce and disseminate information. We aim to make the reader familiar with the central notions and insights in this burgeoning literature and also point to some open critical questions that future research will have to address.
As large amounts of data become available and can be communicated more easily and processed more effectively, information has come to play a central role for economic activity and welfare in our age. This essay overviews contributions to the industrial organization of information markets and nonmarkets, while attempting to maintain a balance between foundational frameworks and more recent developments. We start by reviewing mechanism-design approaches to modeling the trade of information. We then cover ratings, predictions, and recommender systems. We turn to forecasting contests, prediction markets, and other institutions designed for collecting and aggregating information from decentralized participants. Finally, we discuss science as a prototypical information nonmarket with participants who interact in a non-anonymous way to produce and disseminate information. We aim to familiarize the reader with the central notions and insights in this burgeoning literature and also point to some critical open questions that future research will have to address.
Consider a market with identical firms offering a homogeneous good. For any given ex ante distribution of the price count (the number of firms from which a consumer obtains a quote), we derive a tight upper bound on the equilibrium distribution of sales prices. The bound holds across all models of firms’ common-prior higher-order beliefs about the price count, including the extreme cases of full information and no information. One implication of our results is that a small ex ante probability that the price count is equal to one can lead to a large increase in the expected price. The bound also applies in a large class of models where the price count distribution is endogenously determined.
We consider a multiproduct monopoly pricing model. We provide sufficient conditions under which the optimal mechanism can be implemented via upgrade pricing—a menu of product bundles that are nested in the strong set order. Our approach exploits duality methods to identify conditions on the distribution of consumer types under which (a) each product is purchased by the same set of buyers as under separate monopoly pricing (though the transfers can be different), and (b) these sets are nested.
We exhibit two distinct sets of sufficient conditions. The first set of conditions weakens the monotonicity requirement of types and virtual values but maintains a regularity assumption, i.e., that the product-by-product revenue curves are single-peaked. The second set of conditions establishes the optimality of upgrade pricing for type spaces with monotone marginal rates of substitution (MRS)—the relative preference ratios for any two products are monotone across types. The monotone MRS condition allows us to relax the earlier regularity assumption.
Under both sets of conditions, we fully characterize the product bundles and prices that form the optimal upgrade pricing menu. Finally, we show that, if the consumer’s types are monotone, the seller can equivalently post a vector of single-item prices: upgrade pricing and separate pricing are equivalent.
In digital advertising, a publisher selling impressions faces a trade-off in deciding how precisely to match advertisers with viewers. A more precise match generates efficiency gains that the publisher can hope to exploit. A coarser match will generate a thicker market and thus more competition. The publisher can control the precision of the match by controlling the amount of information that advertisers have about viewers. We characterize the optimal trade-off when impressions are sold by auction. The publisher pools premium matches for advertisers (when there will be less competition on average) but gives advertisers full information about lower quality matches.
We consider a multiproduct monopoly pricing model. We provide sufficient conditions under which the optimal mechanism can be implemented via upgrade pricing—a menu of product bundles that are nested in the strong set order. Our approach exploits duality methods to identify conditions on the distribution of consumer types under which (a) each product is purchased by the same set of buyers as under separate monopoly pricing (though the transfers can be different), and (b) these sets are nested.
We exhibit two distinct sets of sufficient conditions. The first set of conditions is given by a weak version of monotonicity of types and virtual values, while maintaining a regularity assumption, i.e., that the product-by-product revenue curves are singlepeaked. The second set of conditions establishes the optimality of upgrade pricing for type spaces with monotone marginal rates of substitution (MRS)—the relative preference ratios for any two products are monotone across types. The monotone MRS condition allows us to relax the earlier regularity assumption.
Under both sets of conditions, we fully characterize the product bundles and prices that form the optimal upgrade pricing menu. Finally, we show that, if the consumer’s types are monotone, the seller can equivalently post a vector of single-item prices: upgrade pricing and separate pricing are equivalent.
In digital advertising, a publisher selling impressions faces a trade-o¤ in deciding how precisely to match advertisers with viewers. A more precise match generates efficiency gains that the publisher can hope to exploit. A coarser match will generate a thicker market and thus more competition. The publisher can control the precision of the match by controlling the amount of information that advertisers have about viewers. We characterize the optimal trade-off when impressions are sold by auction. The publisher pools premium matches for advertisers (when there will be less competition on average) but gives advertisers full information about lower quality matches.
We analyze the optimal information design in a click-through auction with fixed valuations per click, but stochastic click-through rates. While the auctioneer takes as given the auction rule of the click-through auction, namely the generalized second-price auction, the auctioneer can design the information flow regarding the click-through rates among the bidders. A natural requirement in this context is to ask for the information structure to be calibrated in the learning sense. With this constraint, the auction needs to rank the ads by a product of the bid and an unbiased estimator of the click-through rates, and the task of designing an optimal information structure is thus reduced to the task of designing an optimal unbiased estimator.
We show that in a symmetric setting with uncertainty about the click-through rates, the optimal information structure attains both social efficiency and surplus extraction. The optimal information structure requires private (rather than public) signals to the bidders. It also requires correlated (rather than independent) signals, even when the underlying uncertainty regarding the click-through rates is independent. Beyond symmetric settings, we show that the optimal information structure requires partial information disclosure.
This is the sixth in a series of papers prepared by a collection of economists and policy experts in the United States, the UK, and the European Union who have studied, and are committed to the improvement of, competition in digital markets. Previous papers addressed consumer protection in online markets, regulating the market for general search services, the concepts of “fairness” and “contestability” as used in the Digital Markets Act, the use of “equitable interoperability” as a “super tool” to restore and encourage competition in online markets, and coherence between US and European approaches to digital regulation.
This paper is focused not on the Internet architecture – as defined by layering, the narrow waist of IP, and other core design principles – but on the Internet infrastructure, as embodied in the technologies and organizations that provide Internet service. In this paper we discuss both the challenges and the opportunities that make this an auspicious time to revisit how we might best structure the Internet’s infrastructure. Currently, the tasks of transit-between-domains and last-mile-delivery are jointly handled by a set of ISPs who interconnect through BGP. In this paper we propose cleanly separating these two tasks. For transit, we propose the creation of a “public option” for the Internet’s core backbone. This public option core, which complements rather than replaces the backbones used by large-scale ISPs, would (i) run an open market for backbone bandwidth so it could leverage links offered by third-parties, and (ii) structure its terms-of-service to enforce network neutrality so as to encourage competition and reduce the advantage of large incumbents.