Skip to content
Preprint

A Constant-Factor Approximation to Multidimensional Consumer Utility

Oct 2026 · 0 citations · 41 references
Computer Science

TL;DR

This work studies mechanisms that maximize consumer utility for multiple unit-demand buyers and heterogeneous items whose values are drawn independently from known prior distributions and establishes a utility counterpart to the theory of simple, approximately revenue-optimal mechanisms.

Abstract

Motivated by social services where consumers pay with non-transferable ordeals, we study mechanisms that maximize consumer utility for multiple unit-demand buyers and heterogeneous items whose values are drawn independently from known prior distributions. Prior work in utility maximization approximates social welfare and shows that the gap between optimal utility and social welfare is logarithmic. We resolve the question of whether simple mechanisms can guarantee a constant-factor approximation to optimal utility itself. Our mechanisms achieve a $(5.67+\varepsilon)$-approximation for general independent values, improving to $2e/(e-1)<3.164$ when values are i.i.d. Each buyer chooses their favorite option from posted item prices or free item lotteries, and contention resolution determines which buyers'requests are served; this is BIC, ex-post individually rational, and computable in polynomial time. Our main technical contribution is a general upper bound on the optimal ex-ante-constrained utility that separates the contributions captured by posted prices and free lotteries. These results establish a utility counterpart to the theory of simple, approximately revenue-optimal mechanisms.

View source

Similar papers

Preprint Sep 2026

Non-Linear Pricing Restores Tractability for a Data Seller

We consider a data seller who designs pricing mechanisms over multiple datasets to maximize revenue from budget-constrained buyers. The seller offers multiple datasets and assigns each a pricing function that maps the quantity purchased to a total payment. The goal is to design these pricing functions to maximize reven...

B. Chaudhury, Jugal Garg, Eklavya Sharma et al. · 0 citations
Preprint Oct 2026

Support-Dependent Regret Rates for Profit Maximization in Multilateral Trade

We study online profit maximization in multilateral trade, a setting that generalizes both dynamic pricing and bilateral trade. At each round, an intermediary posts prices to buyers and offers payments to sellers; trade occurs only if every agent accepts. We consider valuations drawn from an unknown joint distribution,...

Francesco Bacchiocchi, Matteo Castiglioni, Anna Lunghi et al. · 0 citations
Preprint Sep 2026

Sharp Second-Best Welfare in Bilateral and Matching Markets

How much social welfare must a market lose because values are private? We determine the sharp ratio of second-best to first-best welfare under independent nonnegative types, Bayesian incentive compatibility, interim individual rationality, and no expected budget deficit. The ratio is approximately $0.8882516903$ for ar...

Zheng-Yang Liu, Ying Qin, Zi-He Wang · 0 citations
Preprint Oct 2026

Unit-Demand Pricing for Min-Buying Customers

We study the unit-demand pricing problem under \textit{min-buying} behavior, where customers purchase the lowest-priced item that yields non-negative utility. In contrast to the quasi-linear model, we show that uniform pricing becomes substantially more effective under min-buying. First, we study symmetric environments...

Ti-Ting Cui, Michael L. Hamilton, Jourdain B. Lamperski et al. · 0 citations
Aug 2026

On deterministic optimal mechanisms in a two-item setting for distributions with nondecreasing density

Consider the problem of designing a revenue-optimal auction mechanism when two heterogeneous items are sold to a single buyer having independent valuations over the items. The distributions of the buyer's valuation for the items are assumed to have densities that are positive, nondecreasing, and continuously differenti...

D. Thirumulanathan · 0 citations
Preprint Oct 2026

Optimal Multi-Item Auctions with I.I.D. Values

We study revenue-maximizing multi-item auctions under dominant-strategy incentive compatibility (DSIC) and ex-post individual rationality. Buyers have additive valuations, and all item values are independent draws from a common finite distribution. For every two-point distribution and arbitrary numbers of buyers and it...

Bo-Yu Liu, Zheng-Yang Liu, Zihe Wang · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.