Beyond Truthful Reporting: Robust Strategies for Worst-Case Payoff Maximization in Large Markets

In many large-scale markets mediated by digital platforms, such as advertising, energy trading, transportation logistics, and spectrum auctions, platforms suggest that participants report true valuations to simplify strategic complexity. This recommendation is widely followed by smaller bidders who lack resources for sophisticated strategic analysis. This paper shows that simple deviations from truthful reporting can improve outcomes for such participants. Using a robust optimization framework, we derive practical bidding strategies for generalized first-price, generalized second-price, and core-selecting combinatorial auctions. Our distribution-free approach maximizes worst-case payoffs over a set of plausible competitor bids, without requiring detailed information about rival behavior. We demonstrate that simple strategies, specifically shading bids on preferred bundles, consistently outperform truthful bidding when bidders have straightforward valuation structures. This insight persists even in complex settings where closed-form optimal policies cannot be derived. The results provide actionable guidance for market participants with limited information who lack resources for deploying sophisticated bidding algorithms, while offering market designers insight into how participants might deviate from recommended strategies.

Authors

Institutions

Publication Details

Journal
Information Systems Research
Published
2026-03-13
DOI
https://doi.org/10.1287/isre.2025.2127
Primary Topic
Auction Theory and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Beyond Truthful Reporting: Robust Strategies for Worst-Case Payoff Maximization in Large Markets

Saša Pekeč, Chenxi Xu
Information Systems Research
Auction Theory and Applications
article

Beyond Truthful Reporting: Robust Strategies for Worst-Case Payoff Maximization in Large Markets

Saša Pekeč, Chenxi Xu
article en

Abstract

In many large-scale markets mediated by digital platforms, such as advertising, energy trading, transportation logistics, and spectrum auctions, platforms suggest that participants report true valuations to simplify strategic complexity. This recommendation is widely followed by smaller bidders who lack resources for sophisticated strategic analysis. This paper shows that simple deviations from truthful reporting can improve outcomes for such participants. Using a robust optimization framework, we derive practical bidding strategies for generalized first-price, generalized second-price, and core-selecting combinatorial auctions. Our distribution-free approach maximizes worst-case payoffs over a set of plausible competitor bids, without requiring detailed information about rival behavior. We demonstrate that simple strategies, specifically shading bids on preferred bundles, consistently outperform truthful bidding when bidders have straightforward valuation structures. This insight persists even in complex settings where closed-form optimal policies cannot be derived. The results provide actionable guidance for market participants with limited information who lack resources for deploying sophisticated bidding algorithms, while offering market designers insight into how participants might deviate from recommended strategies.

Information Systems Research
Duke University (US)
Openalex Percentile: Top 27%
Auction Theory and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.