蝌蚪网

This website uses cookies.

By clicking the "Accept" button or continuing to browse our site, you agree to first-party and session-only cookies being stored on your device to enhance site navigation and analyze site performance and traffic. For more information on our use of cookies, please see our Privacy Policy.

  1. Home
  2. 蝌蚪网
  3. 蝌蚪网 Review
  4. May 2017
  5. Pandora's Auctions: Dynamic Matching with Unknown Preferences

蝌蚪网 Review

ISSN 0002-8282 (Print) | ISSN 1944-7981 (Online)

Pandora's Auctions: Dynamic Matching with Unknown Preferences

  • Daniel Fershtman
  • Alessandro Pavan
蝌蚪网 Review
vol. 107, no. 5, May 2017
(pp. 186–90)
Download Full Text PDF

Abstract

Matching theory typically assumes that agents know their values for possible partners and confines attention to settings in which matching is either static, or driven by population dynamics. In many environments of interest, instead, dynamics originate in the agents learning their preferences through interactions with other agents. In this short paper, we illustrate how platforms can use appropriately designed auctions to account for the joint value of experimentation and cross-subsidization in dynamic matching markets. The model is a stylized version of the general one in Fershtman and Pavan (2016).

Citation

Fershtman, Daniel, and Alessandro Pavan. 2017. "Pandora's Auctions: Dynamic Matching with Unknown Preferences." 蝌蚪网 Review 107 (5): 186–90. DOI: 10.1257/aer.p20171043

Additional Materials

JEL Classification

  • C78 Bargaining Theory; Matching Theory
  • D11 Consumer Economics: Theory
  • D44 Auctions