English
Related papers

Related papers: Robust Clearing Price Mechanisms for Reserve Price…

200 papers

We propose a model for price formation in financial markets based on clearing of a standard call auction with random orders, and verify its validity for prediction of the daily closing price distribution statistically. The model considers…

Trading and Market Microstructure · Quantitative Finance 2019-12-02 M. Derksen , B. Kleijn , R. de Vilder

Real-Time Bidding is a new Internet advertising system that has become very popular in recent years. This system works like a global auction where advertisers bid to display their impressions in the publishers' ad slots. The most popular…

Computer Science and Game Theory · Computer Science 2020-10-26 Luis Miralles-Pechuán , Fernando Jiménez , José Manuel García

In the standard single-dimensional model of position auctions, bidders agree on the relative values of the positions and each of them submits a single bid that is interpreted in terms of these values. Motivated by current practice in…

Computer Science and Game Theory · Computer Science 2018-06-22 Paul Dütting , Felix Fischer , David C. Parkes

We study a class of iterative combinatorial auctions which can be viewed as subgradient descent methods for the problem of pricing bundles to balance supply and demand. We provide concrete convergence rates for auctions in this class,…

Computer Science and Game Theory · Computer Science 2016-06-01 Jacob Abernethy , Sébastien Lahaie , Matus Telgarsky

A canonical setting for non-monetary online resource allocation is one where agents compete over multiple rounds for a single item per round, with i.i.d. valuations and additive utilities across rounds. With $n$ symmetric agents, a natural…

Computer Science and Game Theory · Computer Science 2025-12-01 David X. Lin , Giannis Fikioris , Siddhartha Banerjee , Éva Tardos

We study regret minimization in repeated first-price auctions (FPAs), where a bidder observes only the realized outcome after each auction -- win or loss. This setup reflects practical scenarios in online display advertising where the…

Machine Learning · Computer Science 2026-03-19 Yuxiao Wen , Yanjun Han , Zhengyuan Zhou

The progressive second-price auction of Lazar and Semret is a decentralized mechanism for the allocation and real-time pricing of a divisible resource. Our focus is on how delays in the receipt of bid messages, asynchronous analysis by…

Computer Science and Game Theory · Computer Science 2025-11-24 Jordana Blazek , Eric Olson , Fredrick C. Harris

In Bayesian single-item auctions, a monotone bidding strategy--one that prescribes a higher bid for a higher value type--can be equivalently represented as a partition of the quantile space into consecutive intervals corresponding to…

Computer Science and Game Theory · Computer Science 2026-02-10 Junyao Zhao

We consider the fundamental problem of designing a truthful single-item auction with the challenging objective of extracting a large fraction of the highest agent valuation as revenue. Following a recent trend in algorithm design, we assume…

Computer Science and Game Theory · Computer Science 2024-01-25 Ioannis Caragiannis , Georgios Kalantzis

We analyze the problem of how to optimally bid for ad spaces in online ad auctions. For this we consider the general case of multiple ad campaigns with overlapping targeting criteria. In our analysis we first characterize the structure of…

Optimization and Control · Mathematics 2020-04-16 Erik Tillberg , Peter Marbach , Ravi Mazumdar

When online sellers use AI learning algorithms to automatically compete on e-commerce platforms, there is concern that they will learn to coordinate on higher than competitive prices. However, this concern was primarily raised in…

General Economics · Economics 2025-11-03 Hangcheng Zhao , Ron Berman

One method to offer some bidders a discount in a first-price auction is to augment their bids when selecting a winner but only charge them their original bids should they win. Another method is to use their original bids to select a winner,…

Computer Science and Game Theory · Computer Science 2024-03-12 Miguel Alcobendas , Eric Bax

Contextual dynamic pricing aims to set personalized prices based on sequential interactions with customers. At each time period, a customer who is interested in purchasing a product comes to the platform. The customer's valuation for the…

Machine Learning · Statistics 2023-03-07 Yiyun Luo , Will Wei Sun , and Yufeng Liu

We present a new approach to machine learning-powered combinatorial auctions, which is based on the principles of Differential Privacy. Our methodology guarantees that the auction mechanism is truthful, meaning that rational bidders have…

Computer Science and Game Theory · Computer Science 2024-05-20 Arash Jamshidi , Seyed Mohammad Hosseini , Seyed Mahdi Noormousavi , Mahdi Jafari Siavoshani

In many applications, ads are displayed together with the prices, so as to provide a direct comparison among similar products or services. The price-displaying feature not only influences the consumers' decisions, but also affects the…

Artificial Intelligence · Computer Science 2023-03-24 Bin Li , Yahui Lei

In this paper, we deal with the uncertainty of bidding for display advertising. Similar to the financial market trading, real-time bidding (RTB) based display advertising employs an auction mechanism to automate the impression level media…

Computer Science and Game Theory · Computer Science 2017-01-23 Haifeng Zhang , Weinan Zhang , Yifei Rong , Kan Ren , Wenxin Li , Jun Wang

We study the bidding problem in repeated uniform price multi-unit auctions from the perspective of a value-maximizing buyer. The buyer aims to maximize their cumulative value over $T$ rounds while adhering to per-round return-on-investment…

Data Structures and Algorithms · Computer Science 2025-10-07 Negin Golrezaei , Sourav Sahoo

With the advent and increasing consolidation of e-commerce, digital advertising has very recently replaced traditional advertising as the main marketing force in the economy. In the past four years, a particularly important development in…

Computer Science and Game Theory · Computer Science 2022-11-14 Wei Zhang , Yanjun Han , Zhengyuan Zhou , Aaron Flores , Tsachy Weissman

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

We present a mechanism for reservations of bursty resources that is both truthful and robust. It consists of option contracts whose pricing structure induces users to reveal the true likelihoods that they will purchase a given resource.…

Computer Science and Game Theory · Computer Science 2007-05-23 Fang Wu , Zi Zhang , Bernardo A. Huberman