English
Related papers

Related papers: Incentive Compatibility in the Auto-bidding World

200 papers

The internet advertising market is a multi-billion dollar industry, in which advertisers buy thousands of ad placements every day by repeatedly participating in auctions. An important and ubiquitous feature of these auctions is the presence…

Computer Science and Game Theory · Computer Science 2022-10-11 Santiago Balseiro , Christian Kroer , Rachitesh Kumar

Affine Maximizer Auctions (AMAs), a generalized mechanism family from VCG, are widely used in automated mechanism design due to their inherent dominant-strategy incentive compatibility (DSIC) and individual rationality (IR). However, as the…

Computer Science and Game Theory · Computer Science 2026-02-11 Haoran Sun , Xuanzhi Xia , Xu Chu , Xiaotie Deng

In this work we introduce a new class of mechanisms composed of a traditional Generalized Second Price (GSP) auction and a fair division scheme, in order to achieve some desired level of fairness between groups of Bayesian strategic…

Computer Science and Game Theory · Computer Science 2022-10-19 Georgios Birmpas , Andrea Celli , Riccardo Colini-Baldeschi , Stefano Leonardi

Digital advertising platforms and publishers sell ad inventory that conveys targeting information, such as demographic, contextual, or behavioral audience segments, to advertisers. While revealing this information improves ad relevance, it…

General Economics · Economics 2026-01-15 Srinivas Tunuguntla , Carl F. Mela , Jason Pratt

Bidding is a key element of search advertising, but the variation in bidders' valuations and strategies is often overlooked. Disclosing bid information helps uncover this heterogeneity and enables platforms to tailor their disclosure…

General Economics · Economics 2024-10-10 Zhu Mingxi , Song Michelle

Auto-bidding is an area of increasing importance in the domain of online advertising. We study the problem of designing auctions in an auto-bidding setting with the goal of maximizing welfare at system equilibrium. Previous results showed…

Computer Science and Game Theory · Computer Science 2022-04-26 Aranyak Mehta

We study the aggregate welfare and individual regret guarantees of dynamic \emph{pacing algorithms} in the context of repeated auctions with budgets. Such algorithms are commonly used as bidding agents in Internet advertising platforms,…

Computer Science and Game Theory · Computer Science 2026-01-06 Jason Gaitonde , Yingkai Li , Bar Light , Brendan Lucier , Aleksandrs Slivkins

Budget-management systems are one of the key components of modern auction markets. Internet advertising platforms typically offer advertisers the possibility to pace the rate at which their budget is depleted, through budget-pacing…

Computer Science and Game Theory · Computer Science 2021-06-18 Andrea Celli , Riccardo Colini-Baldeschi , Christian Kroer , Eric Sodomka

In digital advertising, online platforms allocate ad impressions through real-time auctions, where advertisers typically rely on autobidding agents to optimize bids on their behalf. Unlike traditional auctions for physical goods, the value…

Computer Science and Game Theory · Computer Science 2025-09-03 Zhicheng Du , Wei Tang , Zihe Wang , Shuo Zhang

In recent years, the growing adoption of autobidding has motivated the study of auction design with value-maximizing auto-bidders. It is known that under mild assumptions, uniform bid-scaling is an optimal bidding strategy in truthful…

Computer Science and Game Theory · Computer Science 2023-11-20 Yuan Deng , Jieming Mao , Vahab Mirrokni , Yifeng Teng , Song Zuo

We examine trade-offs among stakeholders in ad auctions. Our metrics are the revenue for the utility of the auctioneer, the number of clicks for the utility of the users and the welfare for the utility of the advertisers. We show how to…

Computer Science and Game Theory · Computer Science 2014-04-22 Yoram Bachrach , Sofia Ceppi , Ian A. Kash , Peter Key , David Kurokawa

While the auto-bidding literature predominantly considers independent bidding, we investigate the coordination problem among multiple auto-bidders in online advertising platforms. Two motivating scenarios are: collaborative bidding among…

Computer Science and Game Theory · Computer Science 2026-05-27 Yanru Guan , Jiahao Zhang , Zhe Feng , Tao Lin

In online advertising markets, budget-constrained advertisers acquire ad placements through repeated bidding in auctions on various platforms. We present a strategy for bidding optimally in a set of auctions that may or may not be…

Computer Science and Game Theory · Computer Science 2023-06-14 Fransisca Susan , Negin Golrezaei , Okke Schrijvers

Combinatorial auctions (CA) are a well-studied area in algorithmic mechanism design. However, contrary to the standard model, empirical studies suggest that a bidder's valuation often does not depend solely on the goods assigned to him. For…

Computer Science and Game Theory · Computer Science 2015-10-01 Yun Kuen Cheung , Monika Henzinger , Martin Hoefer , Martin Starnberger

In this paper, we study how a budget-constrained bidder should learn to bid adaptively in repeated first-price auctions to maximize cumulative payoff. This problem arises from the recent industry-wide shift from second-price auctions to…

Computer Science and Game Theory · Computer Science 2026-04-14 Yige Wang , Jiashuo Jiang

Modern ad auctions allow advertisers to target more specific segments of the user population. Unfortunately, this is not always in the best interest of the ad platform. In this paper, we examine the following basic question in the context…

Computer Science and Game Theory · Computer Science 2019-07-16 Ashwinkumar Badanidiyuru , Kshipra Bhawalkar , Haifeng Xu

Recent empirical work demonstrates that online advertisement can exhibit bias in the delivery of ads across users even when all advertisers bid in a non-discriminatory manner. We study the design of ad auctions that, given fair bids, are…

Computer Science and Game Theory · Computer Science 2021-12-02 Shuchi Chawla , Meena Jagadeesan

In online ad markets, a rising number of advertisers are employing bidding agencies to participate in ad auctions. These agencies are specialized in designing online algorithms and bidding on behalf of their clients. Typically, an agency…

Computer Science and Game Theory · Computer Science 2023-06-14 Yurong Chen , Qian Wang , Zhijian Duan , Haoran Sun , Zhaohua Chen , Xiang Yan , Xiaotie Deng

We present a number of models for the adword auctions used for pricing advertising slots on search engines such as Google, Yahoo! etc. We begin with a general problem formulation which allows the privately known valuation per click to be a…

Computer Science and Game Theory · Computer Science 2007-05-23 Garud Iyengar , Anuj Kumar

We study a game between autobidding algorithms that compete in an online advertising platform. Each autobidder is tasked with maximizing its advertiser's total value over multiple rounds of a repeated auction, subject to budget and…

Computer Science and Game Theory · Computer Science 2024-12-03 Brendan Lucier , Sarath Pattathil , Aleksandrs Slivkins , Mengxiao Zhang