Search for: All records

A monopolist platform uses data to match heterogeneous consumers with multiproduct sellers. The consumers can purchase the products on the platform or search off the platform. The platform sells targeted ads to sellers that recommend their products to consumers and reveals information to consumers about their match values. The revenue-optimal mechanism is a managed advertising campaign that matches products and preferences efficiently. In equilibrium, sellers offer higher qualities at lower unit prices on than off platform. The platform exploits its information advantage to increase its bargaining power vis-à-vis the sellers. Finally, privacy-respecting data-governance rules can lead to welfare gains for consumers. (JEL D11, D42, D44, D82, D83, M37) 

Abstract We present a model of digital advertising with three key features: (1) advertisers can reach consumers on and off a platform, (2) additional data enhances the value of advertiser–consumer matches, and (3) the allocation of advertisements follows an auction-like mechanism. We contrast data-augmented auctions, which leverage the platform’s data advantage to improve match quality, with managed-campaign mechanisms that automate match formation and price-setting. The platform-optimal mechanism is a managed campaign that conditions the on-platform prices for sponsored products on the off-platform prices set by all advertisers. This mechanism yields the efficient on-platform allocation but inefficiently high off-platform product prices. It attains the vertical integration profit for the platform and the advertisers, and it increases off-platform product prices while decreasing consumer surplus, relative to data-augmented auctions. 

The arrival of digital commerce has lead to an increasing use of personalization and differentiation strategies. With differentiated products along the quality dimension and/or the quantity dimension comes the need for nonlinear pricing policies or second degree price discrimination. The optimal pricing strategies for quality and quantity differentiated products were first investigated by Mussa and Rosen (1978) and Maskin and Riley (1984), respectively. The optimal pricing strategies were shown to depend heavily on the prior distribution of the private information regarding the types, and ultimately the willingness-to-pay of the buyers. Yet, frequently the sellers possess only weak and incomplete information about the distribution of demand. This paper aims to develop robust pricing policies that are independent of specific demand distributions and provide revenue guarantees across all possible distributions. 

We characterize the revenue-maximizing information structure in the second-price auction. The seller faces a trade-off: more information improves the efficiency of the allocation but creates higher information rents for bidders. The information disclosure policy that maximizes the revenue of the seller is to fully reveal low values (where competition is high) but to pool high values (where competition is low). The size of the pool is determined by a critical quantile that is independent of the distribution of values and only dependent on the number of bidders. We discuss how this policy provides a rationale for conflation in digital advertising. (JEL D44, D82, D83, M37) 

A single seller faces a sequence of buyers with unit demand. The buyers are forward‐looking and long‐lived. Each buyer has private information about his arrival time and valuation where the latter evolves according to a geometric Brownian motion. Any incentive‐compatible mechanism has to induce truth‐telling about the arrival time and the evolution of the valuation. We establish that the optimal stationary allocation policy can be implemented by a simple posted price. The truth‐telling constraint regarding the arrival time can be represented as an optimal stopping problem that determines the first time at which the buyer participates in the mechanism. The optimal mechanism thus induces progressive participation by each buyer: he either participates immediately or at a future random time.