【公开学术报告】Screening with Limited Information: A Dual Perspective

Screening with Limited Information: A Dual Perspective

Guest Speaker: Ruiqin WANG (NUS)

Date & Time:      Tue. 3^rd, December 2024, from 10:00 AM to 11:30 AM (Beijing Time)

Zoom Meeting ID: 89669664876 (Password: 382416)

Join via the Link: https://us02web.zoom.us/j/89669664876

ABSTRACT

Consider a seller seeking a selling mechanism to maximize the worst-case revenue obtained from a buyer whose valuation distribution lies in a certain ambiguity set. Such a mechanism design problem with one product and one buyer is known as the screening problem. For a generic convex ambiguity set, we show via the minimax theorem that strong duality holds between the problem of finding the optimal robust mechanism and a minimax pricing problem where the adversary first chooses a worst-case distribution, and then the seller decides the best posted price mechanism. This implies that the extra value of optimizing over more sophisticated mechanisms amounts exactly to the value of eliminating distributional ambiguity under a posted price mechanism. The duality result also connects prior literature that separately studies the primal (robust screening) and problems related to the dual (e.g., robust pricing, buyer-optimal pricing, and personalized pricing). We further analytically solve the minimax pricing problem (as well as the robust pricing problem) for several important ambiguity sets, such as the ones with mean and various dispersion measures, and with the Wasserstein metric, and we provide a unified geometric intuition behind our approach. The solutions are then used to construct the optimal robust mechanism and to compare with the solutions to the robust pricing problem. We also establish the uniqueness of the worst-case distribution for some cases.

Keywords: robust mechanism design • moment condition • mean-preserving contraction/spread • Wasserstein metric