Revenue-Maximizing Auctions: A Bidder’s Standpoint

References

• Abeille M, Calauzènes C, Karoui NE, Nedelec T, Perchet V (2018) Explicit shading strategies for repeated truthful auctions. Preprint, submitted May 1, https://arxiv.org/abs/1805.00256.Google Scholar
• Allouah A, Besbes O (2017) Auctions in the online display advertising chain: A case for independent campaign management. Research Paper No. 17-60, Columbia Business School, New York.Google Scholar
• Amin K, Rostamizadeh A, Syed U (2013) Learning prices for repeated auctions with strategic buyers. Proc. 26th Internat. Conf. on Neural Inform. Processing Systems, vol. 1, 1169–1177.Google Scholar
• Amin K, Rostamizadeh A, Syed U (2014) Repeated contextual auctions with strategic buyers. Proc. 27th Internat. Conf. on Neural Inform. Processing Systems, vol. 1, 622–630.Google Scholar
• Amin K, Kearns M, Key P, Schwaighofer A (2012) Budget optimization for sponsored search: Censored learning in mdps. Proc. 28th Conf. on Uncertainty in Artificial Intelligence, 54–63.Google Scholar
• Ashlagi I, Daskalakis C, Haghpanah N (2016) Sequential mechanisms with ex-post participation guarantees. Proc. ACM Conf. on Econom. and Comput., 213–214.Google Scholar
• Balseiro SR, Candogan O, Gurkan H (2021) Multistage intermediation in display advertising. Manufacturing Service Oper. Management. 23(3):714–730.Link, Google Scholar
• Balseiro SR, Mirrokni VS, Leme RP (2018) Dynamic mechanisms with martingale utilities. Management Sci. 64(11):5062–5082.Link, Google Scholar
• Bulow J, Klemperer P (1996) Auctions vs. negotiations. Amer. Econom. Rev. 86(1):180–194.Google Scholar
• Celis LE, Lewis G, Mobius M, Nazerzadeh H (2014) Buy-it-now or take-a-chance: Price discrimination through randomized auctions. Management Sci. 60(12):2927–2948.Link, Google Scholar
• Cole R, Roughgarden T (2014) The sample complexity of revenue maximization. Proc. 46th Annual ACM Sympos. on Theory of Comput., 243–252.Google Scholar
• Deng Y, Lahaie S (2019) Testing dynamic incentive compatibility in display ad auctions. Proc. 25th ACM SIGKDD Internat. Conf. on Knowledge Discovery & Data Mining, 1616–1624.Google Scholar
• Devanur NR, Huang Z, Psomas CA (2016) The sample complexity of auctions with side information. Proc. 48th Annual ACM Sympos. on Theory of Comput., 426–439.Google Scholar
• Dhangwatnotai P, Roughgarden T, Yan Q (2015) Revenue maximization with a single sample. Games Econom. Behav. 91.Google Scholar
• Epasto A, Mahdian M, Mirrokni V, Zuo S (2018) Incentive-aware learning for large markets. Proc. 2018 World Wide Web Conf., 1369–1378.Google Scholar
• Ewerhart C (2013) Regular type distributions in mechanism design and ρ-concavity. Econom. Theory 53(3):591–603.Crossref, Google Scholar
• Feng Z, Lahaie S, Schneider J, Ye J (2020) Reserve price optimization for first price auctions. Preprint, submitted June 11, https://arxiv.org/abs/2006.06519.Google Scholar
• Feng Z, Schrijvers O, Sodomka E (2019) Online learning for measuring incentive compatibility in ad auctions? Proc. World Wide Web Conf., 2729–2735.Google Scholar
• Fu H, Immorlica N, Lucier B, Strack P (2015) Randomization beats second price as a prior-independent auction. Proc. 16th ACM Conf. on Econom. and Comput., 323–323.Google Scholar
• Golrezaei N, Javanmard A, Mirrokni V (2021a) Dynamic incentive-aware learning: Robust pricing in contextual auctions. Oper. Res. 69(1):297–314.Link, Google Scholar
• Golrezaei N, Lin M, Mirrokni V, Nazerzadeh H (2021b) Boosted second-price auctions: Revenue optimization for heterogeneous bidders. Proc. 27th ACM SIGKDD Conf. Knowledge Discovery & Data Mining (KDD’21), 447–457.Google Scholar
• Hartline JD, Roughgarden T (2009) Simple vs. optimal mechanisms. Proc. 10th ACM Conf. on Electronic Commerce, 225–234.Google Scholar
• Huang Z, Mansour Y, Roughgarden T (2018) Making the most of your samples. SIAM J. Comput. 47(3):651–674.Crossref, Google Scholar
• Kanoria Y, Nazerzadeh H (2014) Dynamic reserve prices for repeated auctions: Learning from bids. Internat. Conf. on Web and Internet Econom., 232–232.Google Scholar
• Kanoria Y, Nazerzadeh H (2021) Incentive-compatible learning of reserve prices for repeated auctions. Oper. Res. 69(2):509–524.Link, Google Scholar
• Kotowski MH (2018) On asymmetric reserve prices. Theoretical Econom. 13(1):205–237.Crossref, Google Scholar
• Krishna V (2009) Auction Theory. Elsevier Monographs (Elsevier).Google Scholar
• Lahaie S, Munoz Medina A, Sivan B, Vassilvitskii S (2018) Testing incentive compatibility in display ad auctions. Proc. 2018 World Wide Web Conf., 1419–1428.Google Scholar
• Mohri M, Medina AM (2014) Learning theory and algorithms for revenue optimization in second price auctions with reserve. Internat. Conf. on Machine Learn., 262–270.Google Scholar
• Mohri M, Medina AM (2015) Revenue optimization against strategic buyers. Proc. 28th Internat. Conf. on Neural Inform. Processing Systems, vol. 2, 2530–2538.Google Scholar
• Morgenstern J, Roughgarden T (2015) The pseudo-dimension of near-optimal auctions. Proc. 28th Internat. Conf. on Neural Inform. Processing Systems, vol. 1, 136–144.Google Scholar
• Morgenstern J, Roughgarden T (2016) Learning simple auctions. Conf. on Learn. Theory, 1298–1318.Google Scholar
• Muthukrishnan S (2009) Ad exchanges: Research issues. Proc. 5th Internat. Workshop on Internet and Network Econom., 1–12.Google Scholar
• Myerson RB (1981) Optimal auction design. Math. Oper. Res. 6(1):58–73.Link, Google Scholar
• Nedelec T, Baudet J, Perchet V, Karoui NE (2021) Adversarial learning for revenue-maximizing auctions. Proc. 20th Internat. Conf. on Autonomous Agents and Multiagent Systems.Google Scholar
• Ostrovsky M, Schwarz M (2011) Reserve prices in Internet advertising auctions: A field experiment. Proc. 12th ACM Conf. on Electronic Commerce, 59–60.Google Scholar
• Paes Leme R, Pál M, Vassilvitskii S (2016) A field guide to personalized reserve prices. Proc. 25th Internat. Conf. on World Wide Web, 1093–1102.Google Scholar
• Riley J, Samuelson W (1981) Optimal auctions. Amer. Econom. Rev. 71(3):381–392.Google Scholar
• Shen W, Lahaie S, Leme RP (2019) Learning to clear the market. Internat. Conf. on Machine Learn., 5710–5718.Google Scholar
• Tang P, Zeng Y (2018) The price of prior dependence in auctions. Proc. ACM Conf. on Econom. and Comput., 485–502.Google Scholar
• Tsybakov AB (2009) Introduction to nonparametric estimation (Springer Science & Business Media).Google Scholar