English

On Solutions for the Maximum Revenue Multi-item Auction under Dominant-Strategy and Bayesian Implementations

Computer Science and Game Theory 2016-07-14 v1

Abstract

Very few exact solutions are known for the monopolist's kk-item nn-buyer maximum revenue problem with additive valuation in which k,n>1k, n >1 and the buyers ii have independent private distributions FijF^j_i on items jj. In this paper we derive exact formulas for the maximum revenue when k=2k=2 and FijF^j_i are any IID distributions on support of size 2, for both the dominant-strategy (DIC) and the Bayesian (BIC) implementations. The formulas lead to the simple characterization that, the two implementations have identical maximum revenue if and only if selling-separately is optimal for the distribution. Our results also give the first demonstration, in this setting, of revenue gaps between the two implementations. For instance, if k=n=2k=n=2 and Pr{XF=1}=Pr{XF=2}=12Pr\{X_F=1\}=Pr\{X_F=2\}=\frac{1}{2}, then the maximum revenue in the Bayesian implementation exceeds that in the dominant-strategy by exactly 2%2\%; the same gap exists for the continuous uniform distribution XFX_F over [a,a+1][2a,2a+1][a, a+1]\cup[2a, 2a+1] for all large aa.

Keywords

Cite

@article{arxiv.1607.03685,
  title  = {On Solutions for the Maximum Revenue Multi-item Auction under Dominant-Strategy and Bayesian Implementations},
  author = {Andrew Chi-Chih Yao},
  journal= {arXiv preprint arXiv:1607.03685},
  year   = {2016}
}
R2 v1 2026-06-22T14:53:22.848Z