Matches in SemOpenAlex for { <https://semopenalex.org/work/W2154014787> ?p ?o ?g. }
Showing items 1 to 72 of
72
with 100 items per page.
- W2154014787 abstract "We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player $i$ has a nonnegative valuation pij for an item j, and the goal is to allocate items to players so as to maximize the minimum total valuation received by each player. There is a large gap in our understanding of this problem. The best known positive result is an ~O(√ n)-approximation algorithm, while there is only a factor 2 hardness known. Better algorithms are known for the restricted assignment case where each item has exactly one nonzero value for the players. We study the effect of bounded degree for items: each item has a nonzero value for at most D players. We show that essentially the case D = 3 is equivalent to the general case, and give a 4-approximation algorithm for D = 2.The current algorithmic results for MaxMin Allocation are based on a complicated LP relaxation called the configuration LP. We present a much simpler LP which is equivalent in power to the configuration LP. We focus on a special case of MaxMin Allocation-a family of instances on which this LP has a polynomially large gap. The technical core of our result for this case comes from an algorithm for an interesting new optimization problem on directed graphs, MaxMinDegree Arborescence, where the goal is to produce an arborescence of large outdegree. We develop an ne-approximation for this problem that runs in nO(1/e) time and obtain a a polylogarithmic approximation that runs in quasipolynomial time, using a lift-and-project inspired LP formulation. In fact, we show that our results imply a rounding algorithm for the relaxations obtained by t rounds of the Sherali-Adams hierarchy applied to a natural LP relaxation of the problem. Roughly speaking, the integrality gap of the relaxation obtained from t rounds of Sherali-Adams is at most n1/t. We are able to extend the latter result to a more general class of instances. Along the way, we prove a result about the existence of a perfect matching in a probabilistically pruned graph which may be of independent interest." @default.
- W2154014787 created "2016-06-24" @default.
- W2154014787 creator A5068388812 @default.
- W2154014787 creator A5071016611 @default.
- W2154014787 creator A5076091318 @default.
- W2154014787 date "2009-05-31" @default.
- W2154014787 modified "2023-09-23" @default.
- W2154014787 title "MaxMin allocation via degree lower-bounded arborescences" @default.
- W2154014787 cites W1578813712 @default.
- W2154014787 cites W1977276352 @default.
- W2154014787 cites W1978593916 @default.
- W2154014787 cites W2044380699 @default.
- W2154014787 cites W2068859584 @default.
- W2154014787 cites W2102201348 @default.
- W2154014787 cites W2133097277 @default.
- W2154014787 cites W2147981433 @default.
- W2154014787 doi "https://doi.org/10.1145/1536414.1536488" @default.
- W2154014787 hasPublicationYear "2009" @default.
- W2154014787 type Work @default.
- W2154014787 sameAs 2154014787 @default.
- W2154014787 citedByCount "74" @default.
- W2154014787 countsByYear W21540147872012 @default.
- W2154014787 countsByYear W21540147872013 @default.
- W2154014787 countsByYear W21540147872014 @default.
- W2154014787 countsByYear W21540147872015 @default.
- W2154014787 countsByYear W21540147872016 @default.
- W2154014787 countsByYear W21540147872017 @default.
- W2154014787 countsByYear W21540147872018 @default.
- W2154014787 countsByYear W21540147872019 @default.
- W2154014787 countsByYear W21540147872020 @default.
- W2154014787 countsByYear W21540147872021 @default.
- W2154014787 countsByYear W21540147872022 @default.
- W2154014787 countsByYear W21540147872023 @default.
- W2154014787 crossrefType "proceedings-article" @default.
- W2154014787 hasAuthorship W2154014787A5068388812 @default.
- W2154014787 hasAuthorship W2154014787A5071016611 @default.
- W2154014787 hasAuthorship W2154014787A5076091318 @default.
- W2154014787 hasBestOaLocation W21540147872 @default.
- W2154014787 hasConcept C114614502 @default.
- W2154014787 hasConcept C121332964 @default.
- W2154014787 hasConcept C134306372 @default.
- W2154014787 hasConcept C24890656 @default.
- W2154014787 hasConcept C2775997480 @default.
- W2154014787 hasConcept C33923547 @default.
- W2154014787 hasConcept C34388435 @default.
- W2154014787 hasConcept C41008148 @default.
- W2154014787 hasConceptScore W2154014787C114614502 @default.
- W2154014787 hasConceptScore W2154014787C121332964 @default.
- W2154014787 hasConceptScore W2154014787C134306372 @default.
- W2154014787 hasConceptScore W2154014787C24890656 @default.
- W2154014787 hasConceptScore W2154014787C2775997480 @default.
- W2154014787 hasConceptScore W2154014787C33923547 @default.
- W2154014787 hasConceptScore W2154014787C34388435 @default.
- W2154014787 hasConceptScore W2154014787C41008148 @default.
- W2154014787 hasLocation W21540147871 @default.
- W2154014787 hasLocation W21540147872 @default.
- W2154014787 hasOpenAccess W2154014787 @default.
- W2154014787 hasPrimaryLocation W21540147871 @default.
- W2154014787 hasRelatedWork W1512363145 @default.
- W2154014787 hasRelatedWork W1871156538 @default.
- W2154014787 hasRelatedWork W1968462015 @default.
- W2154014787 hasRelatedWork W1978042415 @default.
- W2154014787 hasRelatedWork W1996842245 @default.
- W2154014787 hasRelatedWork W2049968816 @default.
- W2154014787 hasRelatedWork W2752028650 @default.
- W2154014787 hasRelatedWork W2964207094 @default.
- W2154014787 hasRelatedWork W3080875783 @default.
- W2154014787 hasRelatedWork W4362554012 @default.
- W2154014787 isParatext "false" @default.
- W2154014787 isRetracted "false" @default.
- W2154014787 magId "2154014787" @default.
- W2154014787 workType "article" @default.