On Revenue Monotonicity in Combinatorial Auctions

by   Andrew Chi-Chih Yao, et al.

Along with substantial progress made recently in designing near-optimal mechanisms for multi-item auctions, interesting structural questions have also been raised and studied. In particular, is it true that the seller can always extract more revenue from a market where the buyers value the items higher than another market? In this paper we obtain such a revenue monotonicity result in a general setting. Precisely, consider the revenue-maximizing combinatorial auction for m items and n buyers in the Bayesian setting, specified by a valuation function v and a set F of nm independent item-type distributions. Let REV(v, F) denote the maximum revenue achievable under F by any incentive compatible mechanism. Intuitively, one would expect that REV(v, G)≥ REV(v, F) if distribution G stochastically dominates F. Surprisingly, Hart and Reny (2012) showed that this is not always true even for the simple case when v is additive. A natural question arises: Are these deviations contained within bounds? To what extent may the monotonicity intuition still be valid? We present an approximate monotonicity theorem for the class of fractionally subadditive (XOS) valuation functions v, showing that REV(v, G)≥ c REV(v, F) if G stochastically dominates F under v where c>0 is a universal constant. Previously, approximate monotonicity was known only for the case n=1: Babaioff et al. (2014) for the class of additive valuations, and Rubinstein and Weinberg (2015) for all subaddtive valuation functions.


page 1

page 2

page 3

page 4


A Note on Approximate Revenue Maximization with Two Items

We consider the problem of maximizing revenue when selling 2 items to a ...

99% Revenue via Enhanced Competition

A sequence of recent studies show that even in the simple setting of a s...

Optimal Auctions through Deep Learning

Designing an auction that maximizes expected revenue is an intricate tas...

Generalizing Virtual Values to Multidimensional Auctions: a Non-Myersonian Approach

We consider the revenue maximization problem of a monopolist via a non-M...

Multi-Item Mechanisms without Item-Independence: Learnability via Robustness

We study the sample complexity of learning revenue-optimal multi-item au...

ProportionNet: Balancing Fairness and Revenue for Auction Design with Deep Learning

The design of revenue-maximizing auctions with strong incentive guarante...

Strong Revenue (Non-)Monotonicity of Single-parameter Auctions

Consider Myerson's optimal auction with respect to an inaccurate prior, ...

Please sign up or login with your details

Forgot password? Click here to reset