12,495 research outputs found
Optimal Competitive Auctions
We study the design of truthful auctions for selling identical items in
unlimited supply (e.g., digital goods) to n unit demand buyers. This classic
problem stands out from profit-maximizing auction design literature as it
requires no probabilistic assumptions on buyers' valuations and employs the
framework of competitive analysis. Our objective is to optimize the worst-case
performance of an auction, measured by the ratio between a given benchmark and
revenue generated by the auction.
We establish a sufficient and necessary condition that characterizes
competitive ratios for all monotone benchmarks. The characterization identifies
the worst-case distribution of instances and reveals intrinsic relations
between competitive ratios and benchmarks in the competitive analysis. With the
characterization at hand, we show optimal competitive auctions for two natural
benchmarks.
The most well-studied benchmark measures the
envy-free optimal revenue where at least two buyers win. Goldberg et al. [13]
showed a sequence of lower bounds on the competitive ratio for each number of
buyers n. They conjectured that all these bounds are tight. We show that
optimal competitive auctions match these bounds. Thus, we confirm the
conjecture and settle a central open problem in the design of digital goods
auctions. As one more application we examine another economically meaningful
benchmark, which measures the optimal revenue across all limited-supply Vickrey
auctions. We identify the optimal competitive ratios to be
for each number of buyers n, that is as
approaches infinity
Prior-free multi-unit auctions with ordered bidders
Prior-free auctions are robust auctions that assume no distribution over bidders' valuations and provide worst-case (input-by-input) approximation guarantees. In contrast to previous work on this topic, we pursue good prior-free auctions with non-identical bidders.
Prior-free auctions can approximate meaningful benchmarks for non-identical bidders only when sufficient qualitative information about the bidder asymmetry is publicly known. We consider digital goods auctions where there is a total ordering of the bidders that is known to the seller, where earlier bidders are in some sense thought to have higher valuations. We use the framework of Hartline and Roughgarden (STOC'08) to define an appropriate revenue benchmark: the maximum revenue that can be obtained from a bid vector using prices that are nonincreasing in the bidder ordering and bounded above by the second-highest bid. This monotone-price benchmark is always as large as the well-known fixed-price benchmark , so designing prior-free auctions with good approximation guarantees is only harder. By design, an auction that approximates the monotone-price benchmark satisfies a very strong guarantee: it is, in particular, simultaneously near-optimal for essentially every Bayesian environment in which bidders' valuation distributions have nonincreasing monopoly prices, or in which the distribution of each bidder stochastically dominates that of the next. Even when there is no distribution over bidders' valuations, such an auction still provides a quantifiable input-by-input performance guarantee.
In this paper, we design a simple -competitive prior-free auction for digital goods with ordered bidders. We also extend the monotone-price benchmark and our -competitive prior-free auction to multi-unit settings with limited supply
Core-competitive Auctions
One of the major drawbacks of the celebrated VCG auction is its low (or zero)
revenue even when the agents have high value for the goods and a {\em
competitive} outcome could have generated a significant revenue. A competitive
outcome is one for which it is impossible for the seller and a subset of buyers
to `block' the auction by defecting and negotiating an outcome with higher
payoffs for themselves. This corresponds to the well-known concept of {\em
core} in cooperative game theory.
In particular, VCG revenue is known to be not competitive when the goods
being sold have complementarities. A bottleneck here is an impossibility result
showing that there is no auction that simultaneously achieves competitive
prices (a core outcome) and incentive-compatibility.
In this paper we try to overcome the above impossibility result by asking the
following natural question: is it possible to design an incentive-compatible
auction whose revenue is comparable (even if less) to a competitive outcome?
Towards this, we define a notion of {\em core-competitive} auctions. We say
that an incentive-compatible auction is -core-competitive if its
revenue is at least fraction of the minimum revenue of a
core-outcome. We study the Text-and-Image setting. In this setting, there is an
ad slot which can be filled with either a single image ad or text ads. We
design an core-competitive randomized auction and an
competitive deterministic auction for the Text-and-Image
setting. We also show that both factors are tight
- …