Robust Bidding in First-Price Auctions: How to Bid Without Knowing What Others Are Doing

References

• Athey S, Levin J, Seira E (2011) Comparing open and sealed bid auctions: Evidence from timber auctions. Quart. J. Econom. 126(1):207–257.Crossref, Google Scholar
• Azar P, Micali S (2012) Optimal parametric auctions. Technical Report MIT-CSAIL-TR-2012-015, Federal Reserve Bank of New York, New York.Google Scholar
• Azar P, Daskalakis C, Micali S, Weinberg SM (2012) Optimal and efficient parametric auctions. Khanna S, Program Chair, SODA ’13: Proc. 24th Annual ACM-SIAM Sympos. Discrete Algorithms (Society for Industrial and Applied Mathematics, Philadelphia), 596–604.Google Scholar
• Bajari P, Hortaçsu A (2005) Are structural estimates of auction models reasonable? Evidence from experimental data. J. Political Econom. 113(4):703–741.Crossref, Google Scholar
• Battigalli P, Siniscalchi M (2003) Rationalizable bidding in first price auctions. Games Econom. Behav. 45(1):38–72.Crossref, Google Scholar
• Bergemann D, Schlag K (2011) Robust monopoly pricing. J. Econom. Theory 146(6):2527–2543.Crossref, Google Scholar
• Blum A, Mansour Y (2007) From external to internal regret. J. Machine Learn. Res. 8:1307–1324.Google Scholar
• Compte O, Postlewaite A (2013) Simple auctions. Working paper, Paris School of Economics, Paris.Google Scholar
• Crawford VP, Iriberri N (2007) Level-k auctions: Can boundedly rational strategic thinking explain the winner’s curse and overbidding in private-value auctions? Econometrica 75(6):1721–1770.Crossref, Google Scholar
• Filiz-Özbay E, Özbay EY (2007) Auctions with anticipated regret: Theory and experiment. Amer. Econom. Rev. 97(4):1407–1418.Crossref, Google Scholar
• Giannakopoulos Y, Poças D, Tsigonias-Dimitriadis A (2020) Robust revenue maximization under minimal statistical information. Chen X, Gravin N, Hoefer M, Mehta R, eds. Proc. 16th Internat. Conf., WINE 2020 (Springer Nature, Cham, Switzerland), 177–190.Google Scholar
• Gretschko V, Mass H (2023) Endogenous worst-case beliefs in first-price auctions. Theoret. Econom. Forthcoming.Google Scholar
• Guo Y, Shmaya E (2019) Robust monopoly regulation. Working paper, Northwestern University, Evanston, IL.Google Scholar
• Güth W, Ivanova-Stenzel R (2003) Asymmetric auction experiments with(out) commonly known beliefs. Econom. Lett. 80(2):195–199.Crossref, Google Scholar
• Halpern JY, Pass R (2012) Iterated regret minimization: A new solution concept. Games Econom. Behav. 74(1):184–207.Crossref, Google Scholar
• Han Y, Zhou Z, Weissman T (2020) Optimal no-regret learning in repeated first-price auctions. Preprint, submitted March 22, https://arxiv.org/abs/2003.09795.Google Scholar
• Hayashi T (2008) Regret aversion and opportunity dependence. J. Econom. Theory 139(1):360–379.Crossref, Google Scholar
• Hon-Snir S, Monderer D, Sela A (1998) A learning approach to auctions. J. Econom. Theory 82(1):65–88.Crossref, Google Scholar
• Huber PJ (1965) A robust version of the probability ratio test. Ann. Math. Statist. 36(6):1753–1758.Crossref, Google Scholar
• Linhard PB, Radner R (1989) Minimax-regret strategies for bargaining over several variables. J. Econom. Theory 48(1):152–178.Crossref, Google Scholar
• Lo KC (1998) Sealed bid auctions with uncertainty averse bidders. Econom. Theory 12(1):1–20.Crossref, Google Scholar
• Loomes G, Sugden R (1982) Regret theory: An alternative theory of rational choice under uncertainty. Econom. J. (London) 92(368):805–824.Google Scholar
• Mass H (2018) Strategies under strategic uncertainty. Working paper, University of Bonn, Bonn, Germany.Google Scholar
• Milnor J (1954) Games against nature. Thrall RH, Coombs CH, Davis RL, eds. Decision Processes (Wiley, New York).Google Scholar
• Radner R (1980) Collusive behavior in noncooperative epsilon-equilibria of oligopolies with long but finite lives. J. Econom. Theory 22(2):136–154.Crossref, Google Scholar
• Renou L, Schlag K (2010) Minimax regret and strategic uncertainty. J. Econom. Theory 145(1):264–286.Crossref, Google Scholar
• Renou L, Schlag K (2011) Implementation in minimax-regret equilibrium. Games Econom. Behav. 71(2):527–533.Crossref, Google Scholar
• Rothkopf MH (2007) Decision analysis: The right tool for auctions. Decision Anal. 4(3):167–172.Link, Google Scholar
• Savage LJ (1951) The theory of statistical decision. J. Amer. Statist. Assoc. 46(253):55–67.Crossref, Google Scholar
• Schlag KH (2018) How to play out of equilibrium: Beating the average. Working paper, University of Vienna, Vienna.Google Scholar
• Schlag KH, Zapechelnyuk A (2016) Value of information when searching for a secretary. Working paper, University of Vienna, Vienna.Google Scholar
• Schlag KH, Zapechelnyuk A (2021) Robust sequential search. Theoret. Econom. 16(2021):1431–1470.Google Scholar
• Sošić G (2007) Collusion in second-price auctions under minimax regret criterion. Production Oper. Management 16(4):471–482.Crossref, Google Scholar
• Stoye J (2011) Axioms for minimax regret choice correspondences. J. Econom. Theory 146(6):2226–2251.Crossref, Google Scholar
• Sutton RS, Barto AG (2018) Reinforcement Learning, 2nd ed. (MIT Press, Cambridge, MA).Google Scholar
• Vickrey W (1961) Counterspeculation, auctions, and competitive sealed tenders. J. Finance 16(1):8–37.Crossref, Google Scholar