English
Related papers

Related papers: Revenue Guarantees in Autobidding Platforms

200 papers

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

Approximate Competitive Equilibrium from Equal Incomes (A-CEEI) is an equilibrium-based solution concept for fair division of discrete items to agents with combinatorial demands. In theory, it is known that in asymptotically large markets:…

Computer Science and Game Theory · Computer Science 2023-06-01 Eric Budish , Ruiquan Gao , Abraham Othman , Aviad Rubinstein , Qianfan Zhang

We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assigned to toll-compatible shortest paths. We first prove that this problem is strongly…

Computer Science and Game Theory · Computer Science 2017-07-24 S. Roch , P. Marcotte , G. Savard

The online ads trading platform plays a crucial role in connecting publishers and advertisers and generates tremendous value in facilitating the convenience of our lives. It has been evolving into a more and more complicated structure. In…

Computer Science and Game Theory · Computer Science 2017-10-02 Zhihui Xie , Kuang-Chih Lee , Liang Wang

Standard ad auction formats do not immediately extend to settings where multiple size configurations and layouts are available to advertisers. In these settings, the sale of web advertising space increasingly resembles a combinatorial…

Computer Science and Game Theory · Computer Science 2020-11-10 Rad Niazadeh , Jason Hartline , Nicole Immorlica , Mohammad Reza Khani , Brendan Lucier

We study the revenue maximization problem of a seller with n heterogeneous items for sale to a single buyer whose valuation function for sets of items is unknown and drawn from some distribution D. We show that if D is a distribution over…

Computer Science and Game Theory · Computer Science 2018-07-05 Aviad Rubinstein , S. Matthew Weinberg

We are interested in the problem of optimal commitments in rank-and-bid based auctions, a general class of auctions that include first price and all-pay auctions as special cases. Our main contribution is a novel approach to solve for…

Computer Science and Game Theory · Computer Science 2015-02-27 Zihe Wang , Pingzhong Tang

We continue the study of the performance for fixed-price mechanisms in the bilateral trade problem, and improve approximation ratios of welfare-optimal mechanisms in several settings. Specifically, in the case where only the buyer…

Computer Science and Game Theory · Computer Science 2023-03-29 Zhengyang Liu , Zeyu Ren , Zihe Wang

The supply function equilibrium (SFE) is a model for competition in markets where each firm offers a schedule of prices and quantities to face demand uncertainty, and has been successfully applied to wholesale electricity markets. However,…

Optimization and Control · Mathematics 2015-02-05 Sheng Yu , Enrique Campos-Nanez

We consider the bilateral trade problem, in which two agents trade a single indivisible item. It is known that the only dominant-strategy truthful mechanism is the fixed-price mechanism: given commonly known distributions of the buyer's…

Computer Science and Game Theory · Computer Science 2021-12-21 Zi Yang Kang , Francisco Pernice , Jan Vondrák

Learning to bid in repeated first-price auctions is a fundamental problem at the interface of game theory and machine learning, which has seen a recent surge in interest due to the transition of display advertising to first-price auctions.…

Computer Science and Game Theory · Computer Science 2024-07-09 Rachitesh Kumar , Jon Schneider , Balasubramanian Sivan

We study the fair allocation of indivisible goods under cardinality constraints, where each agent must receive a bundle of fixed size. This models practical scenarios, such as assigning shifts or forming equally sized teams. Recently,…

Computer Science and Game Theory · Computer Science 2025-07-29 Alviona Mancho , Evangelos Markakis , Nicos Protopapas

Many online platforms today (such as Amazon, Netflix, Spotify, LinkedIn, and AirBnB) can be thought of as two-sided markets with producers and customers of goods and services. Traditionally, recommendation services in these platforms have…

Information Retrieval · Computer Science 2022-01-05 Arpita Biswas , Gourab K Patro , Niloy Ganguly , Krishna P. Gummadi , Abhijnan Chakraborty

We consider a revenue-maximizing single seller with $m$ items for sale to a single buyer whose value $v(\cdot)$ for the items is drawn from a known distribution $D$ of support $k$. A series of works by Cai et al. establishes that when each…

Computer Science and Game Theory · Computer Science 2020-07-13 Natalie Collina , S. Matthew Weinberg

First-price auctions have recently gained significant traction in digital advertising markets, exemplified by Google's transition from second-price to first-price auctions. Unlike in second-price auctions, where bidding one's private…

Machine Learning · Computer Science 2025-10-07 Zihao Hu , Xiaoyu Fan , Yuan Yao , Jiheng Zhang , Zhengyuan Zhou

In programmatic advertising, ad slots are usually sold using second-price (SP) auctions in real-time. The highest bidding advertiser wins but pays only the second-highest bid (known as the winning price). In SP, for a single item, the…

Machine Learning · Computer Science 2020-01-22 Aritra Ghosh , Saayan Mitra , Somdeb Sarkhel , Jason Xie , Gang Wu , Viswanathan Swaminathan

In multi-item screening, optimal selling mechanisms are challenging to characterize and implement, even with full knowledge of valuation distributions. In this paper, we aim to develop tractable, interpretable, and implementable mechanisms…

Theoretical Economics · Economics 2025-10-20 Shixin Wang

Following the work of Babaioff et al, we consider the pricing game with strategic vendors and a single buyer, modeling a scenario in which multiple competing vendors have very good knowledge of a buyer, as is common in online markets. We…

Computer Science and Game Theory · Computer Science 2016-02-10 Allan Borodin , Omer Lev , Tyrone Strangway

In today's online advertising markets, it is common for advertisers to set long-term budgets. Correspondingly, advertising platforms adopt budget control methods to ensure that advertisers' payments lie within their budgets. Most budget…

Computer Science and Game Theory · Computer Science 2024-02-13 Zhaohua Chen , Mingwei Yang , Chang Wang , Jicheng Li , Zheng Cai , Yukun Ren , Zhihua Zhu , Xiaotie Deng

In the private values single object auction model, we construct a satisfactory mechanism - a symmetric, dominant strategy incentive compatible, and budget-balanced mechanism. Our mechanism allocates the object to the highest valued agent…

Computer Science and Game Theory · Computer Science 2016-10-04 Debasis Mishra , Tridib Sharma