Optimal Bi-Valued Auctions
Data Structures and Algorithms
2011-06-24 v1
Abstract
We investigate \emph{bi-valued} auctions in the digital good setting and construct an explicit polynomial time deterministic auction. We prove an unconditional tight lower bound which holds even for random superpolynomial auctions. The analysis of the construction uses the adoption of the finer lens of \emph{general competitiveness} which considers additive losses on top of multiplicative ones. The result implies that general competitiveness is the right notion to use in this setting, as this optimal auction is uncompetitive with respect to competitive measures which do not consider additive losses.
Keywords
Cite
@article{arxiv.1106.4677,
title = {Optimal Bi-Valued Auctions},
author = {Oren Ben-Zwi and Ilan Newman},
journal= {arXiv preprint arXiv:1106.4677},
year = {2011}
}