16 research outputs found
The sample complexity of auctions with side information
Traditionally, the Bayesian optimal auction design problem has been considered either when the bidder values are i.i.d, or when each bidder is individually identifiable via her value distribution. The latter is a reasonable approach when the bidders can be classified into a few categories, but there are many instances where the classification of bidders is a continuum. For example, the classification of the bidders may be based on their annual income, their propensity to buy an item based on past behavior, or in the case of ad auctions, the click through rate of their ads. We introduce an alternate model that captures this aspect, 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. We extend the sample complexity approach of Dhangwatnotai et al. and Cole and Roughgarden to this model and obtain almost matching upper and lower bounds. As an aside, we obtain a revenue monotonicity lemma which may be of independent interest. We also show how to use Empirical Risk Minimization techniques to improve the sample complexity bound of Cole and Roughgarden for the nonidentical but independent value distribution case.link_to_OA_fulltex
Tight Approximation Bounds for Maximum Multi-Coverage
29 pagesInternational audienceIn the classic maximum coverage problem, we are given subsets of a universe along with an integer and the objective is to find a subset of size that maximizes . It is well-known that the greedy algorithm for this problem achieves an approximation ratio of and there is a matching inapproximability result. We note that in the maximum coverage problem if an element is covered by several sets, it is still counted only once. By contrast, if we change the problem and count each element as many times as it is covered, then we obtain a linear objective function, , which can be easily maximized under a cardinality constraint. We study the maximum -multi-coverage problem which naturally interpolates between these two extremes. In this problem, an element can be counted up to times but no more; hence, we consider maximizing the function , subject to the constraint . Note that the case of corresponds to the standard maximum coverage setting and gives us a linear objective. We develop an efficient approximation algorithm that achieves an approximation ratio of for the -multi-coverage problem. In particular, when , this factor is and as grows the approximation ratio behaves as . We also prove that this approximation ratio is tight, i.e., establish a matching hardness-of-approximation result, under the Unique Games Conjecture