Online display advertising markets: A literature review and future directions

H Choi, CF Mela, SR Balseiro… - Information Systems …, 2020 - pubsonline.informs.org
This paper summarizes the display advertising literature, organizing the content by the
agents in the display advertising ecosystem, and proposes new research directions. In doing …

Robust auction design in the auto-bidding world

S Balseiro, Y Deng, J Mao… - Advances in Neural …, 2021 - proceedings.neurips.cc
In classic auction theory, reserve prices are known to be effective for improving revenue for
the auctioneer against quasi-linear utility maximizing bidders. The introduction of reserve …

Dynamic mechanism design: An introduction

D Bergemann, J Välimäki - Journal of Economic Literature, 2019 - aeaweb.org
We provide an introduction to the recent developments of dynamic mechanism design, with
a primary focus on the quasilinear case. First, we describe socially optimal (or efficient) …

Towards efficient auctions in an auto-bidding world

Y Deng, J Mao, V Mirrokni, S Zuo - Proceedings of the Web Conference …, 2021 - dl.acm.org
Auto-bidding has become one of the main options for bidding in online advertisements, in
which advertisers only need to specify high-level objectives and leave the complex task of …

Automated mechanism design via neural networks

W Shen, P Tang, S Zuo - arXiv preprint arXiv:1805.03382, 2018 - arxiv.org
Using AI approaches to automatically design mechanisms has been a central research
mission at the interface of AI and economics [Conitzer and Sandholm, 2002]. Previous …

Computing optimal equilibria and mechanisms via learning in zero-sum extensive-form games

B Zhang, G Farina, I Anagnostides… - Advances in …, 2024 - proceedings.neurips.cc
We introduce a new approach for computing optimal equilibria via learning in games. It
applies to extensive-form settings with any number of players, including mechanism design …

Selling to multiple no-regret buyers

L Cai, SM Weinberg, E Wildenhain, S Zhang - International Conference on …, 2023 - Springer
We consider the problem of repeatedly auctioning a single item to multiple iid buyers who
each use a no-regret learning algorithm to bid over time. In particular, we study the seller's …

Learning and efficiency in games with dynamic population

T Lykouris, V Syrgkanis, É Tardos - Proceedings of the twenty-seventh annual …, 2016 - SIAM
We study the quality of outcomes in repeated games when the population of players is
dynamically changing, and where participants use learning algorithms to adapt to the …

Sequential mechanisms with ex-post participation guarantees

I Ashlagi, C Daskalakis, N Haghpanah - … of the 2016 ACM Conference on …, 2016 - dl.acm.org
How should one sell an item to a buyer whose value for the item will only be realized next
week? Eg consider selling a flight to some executive who may or may not have a meeting …

Autobidding auctions in the presence of user costs

Y Deng, J Mao, V Mirrokni, H Zhang, S Zuo - Proceedings of the ACM …, 2023 - dl.acm.org
We study autobidding ad auctions with user costs, where each bidder is value-maximizing
subject to a return-over-investment (ROI) constraint, and the seller aims to maximize the …