Whole-Page Optimization and Submodular Welfare Maximization with Online Bidders
نویسندگان
چکیده
منابع مشابه
Online Submodular Welfare Maximization: Greedy is Optimal
We prove that no online algorithm (even randomized, against an oblivious adversary) is better than 1/2competitive for welfare maximization with coverage valuations, unless NP = RP . Since the Greedy algorithm is known to be 1/2-competitive for monotone submodular valuations, of which coverage is a special case, this proves that Greedy provides the optimal competitive ratio. On the other hand, w...
متن کاملSubmodular Welfare Maximization
We study different variants of the welfare maximization problem in combinatorial auctions. Assume there are n buyers interested in m items. Indeed they have different valuations on each item, i.e. buyer i has a valuation of wi(j) on item j. In the simplest model, a collection of items S worths ∑ j∈S wi(j) for buyer i; However, in practice, collection of items might have different values than th...
متن کاملSubmodular welfare maximization
We study different variants of the welfare maximization problem in combinatorial auctions. Assume there are n buyers interested in m items. Indeed they have different valuations on each item, i.e. buyer i has a valuation of wi(j) on item j. In the simplest model, a collection of items S worths ∑ j∈S wi(j) for buyer i; However, in practice, collection of items might have different values than th...
متن کاملOnline Submodular Maximization with Preemption
Submodular function maximization has been studied extensively in recent years under various constraints and models. The problem plays a major role in various disciplines. We study a natural online variant of this problem in which elements arrive one-by-one and the algorithm has to maintain a solution obeying certain constraints at all times. Upon arrival of an element, the algorithm has to deci...
متن کاملOnline Continuous Submodular Maximization
In this paper, we consider an online optimization process, where the objective functions are not convex (nor concave) but instead belong to a broad class of continuous submodular functions. We first propose a variant of the Frank-Wolfe algorithm that has access to the full gradient of the objective functions. We show that it achieves a regret bound of O( √ T ) (where T is the horizon of the onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Economics and Computation
سال: 2016
ISSN: 2167-8375,2167-8383
DOI: 10.1145/2892563