Benchmark Design and Prior-independent Optimization

This paper compares two leading approaches for robust optimization in the models of online algorithms and mechanism design. Competitive analysis compares the performance of an online algorithm to an offline benchmark in worst-case over inputs, and prior-independent mechanism design compares the expected performance of a mechanism on an unknown distribution (of inputs, i. e. , agent values) to the optimal mechanism for the distribution in worst case over distributions. For competitive analysis, a critical concern is the choice of benchmark. This paper gives a method for selecting a good benchmark. We show that optimal algorithm/mechanism for the optimal benchmark is equal to the prior-independent optimal algorithm/mechanism. We solve a central open question in prior-independent mechanism design, namely we identify the prior-independent revenue-optimal mechanism for selling a single item to two agents with i. i. d. and regularly distributed values. We use this solution to solve the corresponding benchmark design problem. Via this solution and the above equivalence of prior-independent mechanism design and competitive analysis (a. k. a. prior-free mechanism design) we show that the standard method for lower bounds of prior-free mechanisms is not generally tight for the benchmark design program. 1 1 For the full version of this work, see https: //arxiv. org/abs/2001. 10157.

Authors

• Jason D. Hartline
• Aleck C. Johnsen
• Yingkai Li

Keywords

• Benchmark testing
• Optimization
• Approximation algorithms
• Upper bound
• Standards
• Robustness
• Computer science
• Benchmark Design
• Lower Bound
• Performance Of Algorithm
• Worst Case
• Design Problem
• Mechanical Design
• Input Distribution
• Unknown Distribution
• Regular Distribution
• Online Algorithm
• Optimal Mechanism
• Optimization Problem
• Optimization Algorithm
• Single Agent
• Online Learning
• Point-like
• Standard Algorithm
• Hindsight
• Best Response
• Good And Bad
• Family Of Distributions
• Stochastic Mechanism
• Scale-invariant
• Bayesian Optimization
• Rational Choice Theory
• Alternative Programs
• Bad Ones
• Abstract Terms
• Approximate Ratio
• Norm Constraint