English
Related papers

Related papers: Incentive Compatibility in the Auto-bidding World

200 papers

In online advertising, auto-bidding has become an essential tool for advertisers to optimize their preferred ad performance metrics by simply expressing high-level campaign objectives and constraints. Previous works designed auto-bidding…

Multiagent Systems · Computer Science 2022-01-06 Chao Wen , Miao Xu , Zhilin Zhang , Zhenzhe Zheng , Yuhui Wang , Xiangyu Liu , Yu Rong , Dong Xie , Xiaoyang Tan , Chuan Yu , Jian Xu , Fan Wu , Guihai Chen , Xiaoqiang Zhu , Bo Zheng

Budget pacing is a popular service that has been offered by major internet advertising platforms since their inception. Budget pacing systems seek to optimize advertiser returns subject to budget constraints by smoothly spending advertiser…

Computer Science and Game Theory · Computer Science 2023-12-18 Santiago R. Balseiro , Kshipra Bhawalkar , Zhe Feng , Haihao Lu , Vahab Mirrokni , Balasubramanian Sivan , Di Wang

Notifications are important for the user experience in mobile apps and can influence their engagement. However, too many notifications can be disruptive for users. A typical mobile app usually has several types of notification, managed by…

Computer Science and Game Theory · Computer Science 2023-02-10 Christian Kroer , Deeksha Sinha , Xuan Zhang , Shiwen Cheng , Ziyu Zhou

Many auction settings implicitly or explicitly require that bidders are treated equally ex-ante. This may be because discrimination is philosophically or legally impermissible, or because it is practically difficult to implement or…

Computer Science and Game Theory · Computer Science 2014-11-06 Christos Tzamos , Christopher A. Wilkens

We study the problem of finding the optimal bidding strategy for an advertiser in a multi-platform auction setting. The competition on a platform is captured by a value and a cost function, mapping bidding strategies to value and cost…

Computer Science and Game Theory · Computer Science 2025-02-27 Gagan Aggarwal , Anupam Gupta , Xizhi Tan , Mingfei Zhao

Simple Clock Auctions (SCA) are a mechanism commonly used in spectrum auctions to sell lots of frequency bandwidths. We study such an auction with one player having access to perfect information against straightforward bidders. When the…

Computer Science and Game Theory · Computer Science 2025-12-12 Jad Zeroual , Marianne Akian , Aurélien Bechler , Matthieu Chardy , Stéphane Gaubert

In display advertising, advertisers want to achieve a marketing objective with constraints on budget and cost-per-outcome. This is usually formulated as an optimization problem that maximizes the total utility under constraints. The…

Computer Science and Game Theory · Computer Science 2024-09-09 Anoop R Katti , Rui C. Gonçalves , Rinchin Iakovlev

Algorithms increasingly automate bidding in online auctions, raising concerns about tacit bid suppression and revenue shortfalls. Prior work identifies individual mechanisms behind algorithmic bid suppression, but it remains unclear which…

General Economics · Economics 2026-03-24 Pranjal Rawat

Budget constraints are ubiquitous in online advertisement auctions. To manage these constraints and smooth out the expenditure across auctions, the bidders (or the platform on behalf of them) often employ pacing: each bidder is assigned a…

Computer Science and Game Theory · Computer Science 2023-02-07 Xi Chen , Christian Kroer , Rachitesh Kumar

Ad auctions in sponsored search support ``broad match'' that allows an advertiser to target a large number of queries while bidding only on a limited number. While giving more expressiveness to advertisers, this feature makes it challenging…

Computer Science and Game Theory · Computer Science 2009-01-26 Eyal Even-dar , Yishay Mansour , Vahab Mirrokni , S. Muthukrishnan , Uri Nadav

Auto-bidding systems are widely used in advertising to automatically determine bid values under constraints such as total budget and Return-on-Spend (RoS) targets. Existing works often assume that the value of an ad impression, such as the…

Machine Learning · Computer Science 2026-02-03 Jiale Han , Chun Gan , Chengcheng Zhang , Jie He , Zhangang Lin , Ching Law , Xiaowu Dai

Real-time bidding, as one of the most popular mechanisms for selling online ad slots, facilitates advertisers to reach their potential customers. The goal of bidding optimization is to maximize the advertisers' return on investment (ROI)…

Computer Science and Game Theory · Computer Science 2019-03-01 Manxing Du , Alexander I. Cowen-Rivers , Ying Wen , Phu Sakulwongtana , Jun Wang , Mats Brorsson , Radu State

First-price auctions have largely replaced traditional bidding approaches based on Vickrey auctions in programmatic advertising. As far as learning is concerned, first-price auctions are more challenging because the optimal bidding strategy…

Machine Learning · Computer Science 2021-11-23 Juliette Achddou , Olivier Cappé , Aurélien Garivier

In online advertising, a set of potential advertisements can be ranked by a certain auction system where usually the top-1 advertisement would be selected and displayed at an advertising space. In this paper, we show a selection bias issue…

Information Retrieval · Computer Science 2022-06-09 Shinya Suzumura , Hitoshi Abe

Modern content platforms offer paid promotion to mitigate cold start by allocating exposure via auctions. Our empirical analysis reveals a counterintuitive flaw in this paradigm: while promotion rescues low-to-medium quality content, it can…

Computer Science and Game Theory · Computer Science 2026-01-29 Yumou Liu , Zhenzhe Zheng , Jiang Rong , Yao Hu , Fan Wu , Guihai Chen

The optimization of bidding strategies for online advertising slot auctions presents a critical challenge across numerous digital marketplaces. A significant obstacle to the development, evaluation, and refinement of real-time autobidding…

Many popular search engines run an auction to determine the placement of advertisements next to search results. Current auctions at Google and Yahoo! let advertisers specify a single amount as their bid in the auction. This bid is…

Computer Science and Game Theory · Computer Science 2007-05-23 Gagan Aggarwal , S. Muthukrishnan , Jon Feldman

In this paper, we study sequential auctions with two budget constrained bidders and any number of identical items. All prior results on such auctions consider only two items. We construct a canonical outcome of the auction that is the only…

Computer Science and Game Theory · Computer Science 2012-09-11 Zhiyi Huang , Nikhil R. Devanur , David Malec

The first-price auction is popular in practice for its simplicity and transparency. Moreover, its potential virtues grow in complex settings where incentive compatible auctions may generate little or no revenue. Unfortunately, the…

Computer Science and Game Theory · Computer Science 2013-04-30 Darrell Hoy , Kamal Jain , Christopher A. Wilkens

We initiate the study of an interesting aspect of sponsored search advertising, namely the consequences of broad match-a feature where an ad of an advertiser can be mapped to a broader range of relevant queries, and not necessarily to the…

Computer Science and Game Theory · Computer Science 2008-07-21 Sudhir Kumar Singh , Vwani P. Roychowdhury
‹ Prev 1 4 5 6 7 8 10 Next ›