Dynamic Mechanisms with Martingale Utilities

References

• Akan M, Ata B, Dana JD Jr (2015) Revenue management by sequential screening. J. Econom. Theory 159(Part B):728–774.Crossref, Google Scholar
• Ashlagi I, Daskalakis C, Haghpanah N (2016) Sequential mechanisms with ex-post participation guarantees. Proc. 2016 ACM Conf. Econom. Comput. (ACM, New York), 213–214.Crossref, Google Scholar
• Asmussen S (2008) Applied Probability and Queues, Vol. 51 (Springer Science+Business Media, New York).Google Scholar
• Babaioff M, Immorlica N, Lucier B, Weinberg SM (2014) A simple and approximately optimal mechanism for an additive buyer. 55th IEEE Ann. Sympos. Foundations of Comput. Sci. (IEEE, New York), 21–30.Crossref, Google Scholar
• Balseiro SR, Besbes O, Weintraub GY (2016) Dynamic mechanism design with budget constrained buyers under limited commitment. Proc. 2016 ACM Conf. Econom. Comput. (ACM, New York), 815–815.Crossref, Google Scholar
• Belloni A, Chen B, Sun P (2015) Structures of optimal contracts in dynamic mechanism design with one agent. Working paper, Duke University, Durham, NC.Google Scholar
• Bertsekas DP (2012) Dynamic Programming and Optimal Control, 4th ed. Vol. 2 (Athena Scientific, Nashua, NH).Google Scholar
• Besanko D (1985) Multi-period contracts between principal and agent with adverse selection. Econom. Lett. 17(1):33–37.Crossref, Google Scholar
• Bhalgat A, Feldman J, Mirrokni V (2012) Online allocation of display ads with smooth delivery. Proc. 18th ACM SIGKDD Internat. Conf. Knowledge Discovery and Data Mining (ACM, New York), 1213–1221.Crossref, Google Scholar
• Biais B, Mariotti T, Plantin G, Rochet J-C (2007) Dynamic security design: Convergence to continuous time and asset pricing implications. Rev. Econom. Stud. 74(2):345–390.Crossref, Google Scholar
• Board S, Skrzypacz A (2016) Revenue management with forward-looking buyers. J. Political Econom. 124(4):1046–1087.Crossref, Google Scholar
• Chen Y, Farias VF (2015) Robust dynamic pricing with strategic customers. Proc. 2015 ACM Conf. Econom. Comput. (ACM, New York), 777–777.Crossref, Google Scholar
• Deb R, Said M (2015) Dynamic screening with limited commitment. J. Econom. Theory 159(Part B):891–928.Crossref, Google Scholar
• eMarketer (2017) eMarketer releases new programmatic advertising estimates. (April 18), https://www.emarketer.com/Article/eMarketer-Releases-New-Programmatic-Advertising-Estimates/1015682.Google Scholar
• Fiat A, Karlin A, Koutsoupias E, Vidali A (2013) Approaching utopia: Strong truthfulness and externality-resistant mechanisms. Proc. 4th Conf. Innovations Theoret. Comput. Sci. (ACM, New York), 221–230.Crossref, Google Scholar
• Gallien J (2006) Dynamic mechanism design for online commerce. Oper. Res. 54(2):291–310.Link, Google Scholar
• Gershkov A, Moldovanu B (2014) Dynamic Allocation and Pricing: A Mechanism Design Approach (MIT Press, Cambridge, MA).Google Scholar
• Green EJ (1987) Lending and the smoothing of uninsurable income. Prescott EC, Wallace N, eds. Contractual Arrangements for Intertemporal Trade, Vol. 1 (University of Minnesota Press, Minneapolis), 3–25.Google Scholar
• Hart S, Nisan N (2012) Approximate revenue maximization with multiple items. ACM Conf. Electronic Commerce, 656.Crossref, Google Scholar
• Jackson MO, Sonnenschein HF (2007) Overcoming incentive constraints by linking decisions. Econometrica 75(1):241–257.Crossref, Google Scholar
• Kakade S, Lobel I, Nazerzadeh H (2013) Optimal dynamic mechanism design and the virtual pivot mechanism. Oper. Res. 61(3): 837–854.Link, Google Scholar
• Kanoria Y, Nazerzadeh H (2017) Dynamic reserve prices for repeated auctions: Learning from bids. Working paper, Columbia University, New York.Google Scholar
• Krähmer D, Strausz R (2015) Optimal sales contracts with withdrawal rights. Rev. Econom. Stud. 82(2):762–790.Crossref, Google Scholar
• Krishna RV, Lopomo G, Taylor CR (2013) Stairway to heaven or highway to hell: Liquidity, sweat equity, and the uncertain path to ownership. RAND J. Econom. 44(1):104–127.Crossref, Google Scholar
• Laffont J-J, Martimort D (2001) The Theory of Incentives: The Principal-Agent Model (Princeton University Press, Princeton, NJ).Google Scholar
• Lariviere MA, Porteus EL (2001) Selling to the newsvendor: An analysis of price-only contracts. Manufacturing Service Oper. Management 3(4):293–305.Link, Google Scholar
• Manelli AM, Vincent DR (2006) Bundling as an optimal selling mechanism for a multiple-good monopolist. J. Econom. Theory 127(1):1–35.Crossref, Google Scholar
• Marcinkiewicz J, Zygmund A (1937) Quelques théorèmes sur les fonctions indépendantes. Fund. Math. 29:60–90.Google Scholar
• Mirrokni VS, Leme RP, Tang P, Zuo S (2016a) Dynamic auctions with bank accounts. Proc. Twenty-fifth Internat. Joint Conf. on Artificial Intelligence, 387–399.Google Scholar
• Mirrokni VS, Leme RP, Tang P, Zuo S (2016b) Optimal dynamic mechanisms with ex-post IR via bank accounts. arXiv:1605.08840.Google Scholar
• Mirrokni VS, Leme RP, Tang P, Zuo S (2017) Non-clairvoyant dynamic mechanism design. Mimeo, July 7, https://ssrn.com/abstract=2873701.Google Scholar
• Muthukrishnan S (2009) Ad exchanges: Research issues. Leonardi S, ed. International Workshop on Internet and Network Economics, Lecture Notes in Computer Science, Vol. 5929 (Springer, Berlin), 1–12.Crossref, Google Scholar
• Myerson R (1981) Optimal auction design. Math. Oper. Res. 6(1): 58–73.Link, Google Scholar
• Papadimitriou CH, Pierrakos G, Psomas C-A, Rubinstein A (2014) On the complexity of dynamic mechanism design. arXiv:1407.5373.Google Scholar
• Pavan A, Segal I, Toikka J (2014) Dynamic mechanism design: A Myersonian approach. Econometrica 82(2):601–653.Crossref, Google Scholar
• Spear SE, Srivastava S (1987) On repeated moral hazard with discounting. Rev. Econom. Stud. 54(4):599–617.Crossref, Google Scholar
• Thomas J, Worrall T (1990) Income fluctuation and asymmetric information: An example of a repeated principal-agent problem. J. Econom. Theory 51(2):367–390.Crossref, Google Scholar
• Vulcano G, van Ryzin G, Maglaras C (2002) Optimal dynamic auctions for revenue management. Management Sci. 48(11): 1388–1407.Link, Google Scholar
• Yao AC (2015) An n-to-1 bidder reduction for multi-item auctions and its applications. Proc. Twenty-Sixth Ann. ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 92–109.Crossref, Google Scholar