Near-optimal multi-unit auctions with ordered bidders

@inproceedings{Koutsoupias2013NearoptimalMA,
  title={Near-optimal multi-unit auctions with ordered bidders},
  author={Elias Koutsoupias and Stefano Leonardi and Tim Roughgarden},
  booktitle={EC '13},
  year={2013}
}
We construct prior-free auctions with constant-factor approximation guarantees with ordered bidders, in both unlimited and limited supply settings. We compare the expected revenue of our auctions on a bid vector to the monotone price benchmark, the maximum revenue that can be obtained from a bid vector using supply-respecting prices that are nonincreasing in the bidder ordering and bounded above by the second-highest bid. As a consequence, our auctions are simultaneously near-optimal in a wide… 
Optimal competitive auctions
TLDR
The characterization identifies the worst-case distribution of instances and reveals intrinsic relations between competitive ratios and benchmarks in the competitive analysis, which establishes a sufficient and necessary condition that characterizes competitive ratios for all monotone benchmarks.
The sample complexity of auctions with side information
TLDR
This work introduces an alternate model, where bidders are a priori identical, but can be distinguished based (only) on some side information the auctioneer obtains at the time of the auction.
Core-competitive Auctions
TLDR
This paper designs an incentive-compatible auction whose revenue is comparable (even if less) to a competitive outcome and defines a notion of core-competitive auctions, which are known for having good revenue properties and lack the desired incentive-compatibility property of the VCG auction.
Simple vs Optimal Auctions: An Experimental Investigation
In single object auctions when bidders are asymmetric, the Myersonian optimal auction is di¢ cult to implement because of its complexity and possible discouragement e¤ect on the bidders. In these

References

SHOWING 1-10 OF 33 REFERENCES
Prior-free auctions with ordered bidders
TLDR
A simple prior-free auction for digital goods with ordered bidders, the Random Price Restriction (RPR) auction is designed and it is proved that its expected revenue on every bid profile b is Ω(M(b)/log*n), where M denotes the monotone-price benchmark and log*n denotes the number of times that the log2 operator can be applied to n before the result drops below a fixed constant.
Competitive auctions and digital goods
TLDR
It is shown that for any truthful auction, even a multi-price auction, the expected revenue does not exceed that for optimal fixed pricing, and a bound on how far the revenue can be from the total market utility is given.
Limited and online supply and the bayesian foundations of prior-free mechanism design
TLDR
The Bayesian optimal mechanism for these variants of auctions for selling a limited supply of a single commodity is described and the random sampling auction is extended to address the prior-free case.
Competitive auctions
Simple versus optimal mechanisms
The monopolist's theory of optimal single-item auctions for agents with independent private values can be summarized by two statements. The first is from Myerson [8]: the optimal auction is Vickrey
Prior-Independent Multi-parameter Mechanism Design
TLDR
This paper presents a prior-independent auction that is guaranteed to achieve a constant fraction of the optimal expected profit for a large class of, so called, "regular" distributions, without specific knowledge of the distributions.
Revenue maximization with a single sample
TLDR
This work designs and analyzes approximately revenue-maximizing auctions in general single-parameter settings and gives an auction that, for every environment and unknown valuation distributions, has expected revenue at least a constant fraction of the expected optimal welfare.
Envy, truth, and profit
TLDR
It is shown that envy-free pricing has a simple nice structure and a strong connection to incentive compatible mechanism design, and this connection is exploited to design prior-free mechanisms with strong approximation guarantees.
Envy-free auctions for digital goods
TLDR
The main result is to show that no constant-competitive auction that is truthful and always gives outcomes are envy-free, and two relaxations of these requirements are considered, allowing the auction to be untruthful with vanishingly small probability, and to give non-envy-free outcomes.
Supply-limiting mechanisms
TLDR
It is proved that "supply-limiting mechanisms" achieve near-optimal expected revenue in a range of single- and multi-parameter Bayesian settings, and essentially match the state-of-the-art in prior-independent mechanism design.
...
...