Fetching the paper…
Reading the bibliography…
We study a game between autobidding algorithms that compete in an online advertising platform.
Introduction to Online Convex Optimization
Elad Hazan · 1909
Earlier work this paper cites.
Subjectivity and correlation in randomized strategies
Robert J. Aumann · 1974
Earlier work this paper cites.
Strategically zero-sum games: the class of games whose completely mixed equilibria cannot be improved upon
Herve Moulin and Jean-Paul Vial · 1978
Earlier work this paper cites.
A simple adaptive procedure leading to correlated equilibrium
Sergiu Hart and Andreu Mas-Colell · 2000
Earlier work this paper cites.
Dynamics of bid optimization in online advertisement auctions
Christian Borgs, Jennifer T. Chayes, Nicole Immorlica, Kamal Jain, Omid Etesami, and Mohammad Mahdian · 2007
Earlier work this paper cites.
Bandits with knapsacks
Ashwinkumar Badanidiyuru, Robert Kleinberg, and Aleksandrs Slivkins · 2013
Earlier work this paper cites.
Bandits with global convex constraints and objective
Shipra Agrawal and Nikhil R. Devanur · 2014
Earlier work this paper cites.
Efficiency guarantees in auctions with budgets
Shahar Dobzinski and Renato Paes Leme · 2014
Earlier work this paper cites.
The price of anarchy in auctions
Tim Roughgarden, Vasilis Syrgkanis, and Éva Tardos · 2017
Earlier work this paper cites.
Multiplicative weights update in zero-sum games
James P. Bailey and Georgios Piliouras · 2018
Earlier work this paper cites.
Multiplicative pacing equilibria in auction markets
Vincent Conitzer, Christian Kroer, Eric Sodomka, and Nicolás E. Stier Moses · 2018
Earlier work this paper cites.
Training gans with optimism
Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, and Haoyang Zeng · 2018
Earlier work this paper cites.
Cycles in adversarial regularized learning
Panayotis Mertikopoulos, Christos H. Papadimitriou, and Georgios Piliouras · 2018
Earlier work this paper cites.
Autobidding with constraints
Gagan Aggarwal, Ashwinkumar Badanidiyuru, and Aranyak Mehta · 2019
Cited alongside, same era.
Learning in repeated auctions with budgets: Regret minimization and equilibrium
Santiago R Balseiro and Yonatan Gur · 2019
Cited alongside, same era.
Vortices instead of equilibria in minmax optimization: Chaos and butterfly effects of online learning in zero-sum games
Yun Kuen Cheung and Georgios Piliouras · 2019
Cited alongside, same era.
Pacing equilibrium in first-price auction markets
Vincent Conitzer, Christian Kroer, Debmalya Panigrahi, Okke Schrijvers, Eric Sodomka, Nicolás E. Stier Moses, and Chris Wilkens · 2019
Cited alongside, same era.
Last-iterate convergence: Zero-sum games and constrained min-max optimization
Constantinos Daskalakis and Ioannis Panageas · 2019
Cited alongside, same era.
Adversarial bandits with knapsacks
Nicole Immorlica, Karthik Abinav Sankararaman, Robert Schapire, and Aleksandrs Slivkins · 2019
Frontiers: Algorithmic collusion: Supra-competitive prices via independent algorithms
Karsten T Hansen, Kanishka Misra, and Mallesh M Pai · 2021
Later among the works it cites.
Linear last-iterate convergence in constrained saddle-point optimization
Chen-Yu Wei, Chung-Wei Lee, Mengxiao Zhang, and Haipeng Luo · 2021
Later among the works it cites.
Artificial intelligence, algorithm design and pricing
John Asker, Chaim Fershtman, Ariel Pakes, et al · 2022
Later among the works it cites.
Contextual standard auctions with budgets: Revenue equivalence and efficiency guarantees
Santiago R. Balseiro, Christian Kroer, and Rachitesh Kumar · 2022
Later among the works it cites.
A general framework for safe decision making: A convex duality approach
Martino Bernasconi, Federico Cacciamani, Nicola Gatti, and Francesco Trovò · 2022
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
The best of many worlds: Dual mirror descent for online allocation problems
Santiago R. Balseiro, Haihao Lu, and Vahab S. Mirrokni · 2020
Cited alongside, same era.
Artificial intelligence, algorithmic pricing, and collusion
Emilio Calvano, Giacomo Calzolari, Vincenzo Denicolo, and Sergio Pastorello · 2020
Cited alongside, same era.
Tight last-iterate convergence rates for no-regret learning in multi-player games
Noah Golowich, Sarath Pattathil, and Constantinos Daskalakis · 2020
Cited alongside, same era.
Non-quasi-linear agents in quasi-linear mechanisms (extended abstract)
Moshe Babaioff, Richard Cole, Jason D. Hartline, Nicole Immorlica, and Brendan Lucier · 2021
Cited alongside, same era.
Robust auction design in the auto-bidding world
Santiago Balseiro, Yuan Deng, Jieming Mao, Vahab Mirrokni, and Song Zuo · 2021
Cited alongside, same era.
The complexity of pacing for second-price auctions
Xi Chen, Christian Kroer, and Rachitesh Kumar · 2021
Cited alongside, same era.
Zhe Feng, Swati Padmanabhan, and Di Wang · 2022
Later among the works it cites.
Bidding agent design in the linkedin ad marketplace
Yuan Gao, Kaiyu Yang, Yuanlong Chen, Min Liu, and Noureddine El Karoui · 2022
Later among the works it cites.
Auto-bidding equilibrium in roi-constrained online advertising markets
Juncheng Li and Pingzhong Tang · 2022
Later among the works it cites.
Algorithmic pricing facilitates tacit collusion: Evidence from e-commerce
Leon Musolff · 2022
Later among the works it cites.
Introduction to multi-armed bandits
Aleksandrs Slivkins · 2022
Later among the works it cites.
Budget pacing in repeated auctions: Regret and efficiency without convergence
Jason Gaitonde, Yingkai Li, Bar Light, Brendan Lucier, and Aleksandrs Slivkins · 2023
Closest in time.
Auctions without commitment in the auto-bidding world
Aranyak Mehta and Andres Perlroth · 2023
Closest in time.