Technical Note—Dynamic Mechanism Design with Capacity Constraint

Published Online:https://doi.org/10.1287/opre.2023.2449

References

  • Armstrong M, Zhou J (2015) Search deterrence. Rev. Econom. Stud. 83:26–57.CrossrefGoogle Scholar
  • Baron DP, Besanko D (1984) Regulation and information in a continuing relationship. Inform. Econom. Policy 1:267–302.CrossrefGoogle Scholar
  • Battaglini M (2005) Long-term contracting with Markovian consumers. Amer. Econom. Rev. 95:637–658.CrossrefGoogle Scholar
  • Battaglini M, Lamba R (2019) Optimal dynamic contracting: The first-order approach and beyond. Theoretical Econom. 14:1435–1482.CrossrefGoogle Scholar
  • Bergemann D, Välimäki J (2019) Dynamic mechanism design: An introduction. J. Econom. Literature 57:235–274.CrossrefGoogle Scholar
  • Besanko D (1985) Multi-period contracts between principal and agent with adverse selection. Econom. Lett. 17:33–37.CrossrefGoogle Scholar
  • Besbes O, Lobel I (2015) Intertemporal price discrimination: Structure and computation of optimal policies. Management Sci. 61:92–110.LinkGoogle Scholar
  • Besbes O, Zeevi A (2015) On the (surprising) sufficiency of linear models for dynamic pricing with demand learning. Management Sci. 61:723–739.LinkGoogle Scholar
  • Board S, Skrzypacz A (2016) Revenue management with forward looking buyers. J. Political Econom. 124:1046–1087.CrossrefGoogle Scholar
  • Borgs C, Candogan O, Chayes J, Lobel I, Nazerzadeh H (2014) Optimal multiperiod pricing with service guarantees. Management Sci. 60:1792–1811.LinkGoogle Scholar
  • Courty P, Li H (2000) Sequential screening. Rev. Econom. Stud. 67:697–717.CrossrefGoogle Scholar
  • Crémer J, McLean RP (1988) Full extraction of the surplus in Bayesian and dominant strategy auctions. Econometrica 56:1247–1257.CrossrefGoogle Scholar
  • Esõ P, Szentes B (2007) Optimal information disclosure in auctions and the handicap auction. Rev. Econom. Stud. 74:705–731.CrossrefGoogle Scholar
  • Fernandes A, Phelan C (2000) A recursive formulation for repeated agency with history dependence. J. Econom. Theory 91:223–247.CrossrefGoogle Scholar
  • Gallien J (2006) Dynamic mechanism design for online commerce. Oper. Res. 54:291–310.LinkGoogle Scholar
  • Garrett D (2016) Intertemporal price discrimination: Dynamic arrivals and changing values. Amer. Econom. Rev. 106:3275–3299.CrossrefGoogle Scholar
  • Garrett D (2017) Dynamic mechanism design: Dynamic arrivals and changing values. Games Econom. Behav. 104:595–612.CrossrefGoogle Scholar
  • Gershkov A, Moldovanu B (2009) Dynamic revenue maximization with heterogeneous objects: A mechanism design approach. Amer. Econom. J. Microeconom. 1:168–198.CrossrefGoogle Scholar
  • Gershkov A, Moldovanu B, Strack P (2017) Revenue-maximizing mechanisms with strategic customers and unknown, Markovian demand. Management Sci. 64:2031–2046.LinkGoogle Scholar
  • Kakade SM, Lobel I, Nazerzadeh H (2013) Optimal dynamic mechanism design and the virtual–pivot mechanism. Oper. Res. 61:837–854.LinkGoogle Scholar
  • Kapička M (2013) Efficient allocations in dynamic private information economies with persistent shocks: A first-order approach. Rev. Econom. Stud. 80:1027–1054.CrossrefGoogle Scholar
  • Keskin NB, Zeevi A (2014) Dynamic pricing with an unknown demand model: Asymptotically optimal semi-myopic policies. Oper. Res. 62:1142–1167.LinkGoogle Scholar
  • Liu B, Lu J (2018) Pairing provision price and default remedy: Optimal two–stage procurement with private R&D efficiency. RAND J. Econom. 49:619–655.CrossrefGoogle Scholar
  • Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6:58–73.LinkGoogle Scholar
  • Pavan A (2017) Dynamic mechanism design: Robustness and endogenous types. Honore MPB, Pakes A, Samuelson L, eds. Proc. Advances in Econom. and Econometrics:11th World Congress (Cambridge University Press, Cambridge, UK), 1–62.Google Scholar
  • Pavan A, Segal I, Toikka J (2014) Dynamic mechanism design: A Myersonian approach. Econometrica 80:601–653.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.