Approximation algorithms for non-single-minded profit-maximization problems with limited supply

Khaled Elbassioni, Mahmoud Fouz, Chaitanya Swamy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

We consider profit-maximization problems for combinatorial auctions with non-single minded valuation functions and limited supply. We obtain fairly general results that relate the approximability of the profit-maximization problem to that of the corresponding social-welfare-maximization (SWM) problem, which is the problem of finding an allocation (S 1,...,S n ) satisfying the capacity constraints that has maximum total value ∑ j v j (S j ). Our results apply to both structured valuation classes, such as subadditive valuations, as well as arbitrary valuations. For subadditive valuations (and hence submodular, XOS valuations), we obtain a solution with profit , where is the optimum social welfare and c max is the maximum item-supply; thus, this yields an O(logc max )-approximation for the profit-maximization problem. Furthermore, given any class of valuation functions, if the SWM problem for this valuation class has an LP-relaxation (of a certain form) and an algorithm "verifying" an integrality gap of α for this LP, then we obtain a solution with profit , thus obtaining an O(α\log c-{\max})- approximation. The latter result implies an -approximation for the profit maximization problem for combinatorial auctions with arbitrary valuations, and an O(logc max )-approximation for the non-single-minded tollbooth problem on trees. For the special case, when the tree is a path, we also obtain an incomparable O(logm)-approximation (via a different approach) for subadditive valuations, and arbitrary valuations with unlimited supply.

Original languageBritish English
Title of host publicationInternet and Network Economics - 6th International Workshop, WINE 2010, Proceedings
Pages462-472
Number of pages11
DOIs
StatePublished - 2010
Event6th International Workshop on Internet and Network Economics, WINE 2010 - Stanford, CA, United States
Duration: 13 Dec 201017 Dec 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6484 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference6th International Workshop on Internet and Network Economics, WINE 2010
Country/TerritoryUnited States
CityStanford, CA
Period13/12/1017/12/10

Fingerprint

Dive into the research topics of 'Approximation algorithms for non-single-minded profit-maximization problems with limited supply'. Together they form a unique fingerprint.

Cite this