Matches in SemOpenAlex for { <https://semopenalex.org/work/W1879947412> ?p ?o ?g. }
Showing items 1 to 58 of
58
with 100 items per page.
- W1879947412 abstract "An active stream of research is devoted to the design of polynomial approximation algorithms for the fair allocation of indivisible goods. Central to this field is the MaxMin Allocation problem, for which there is a significant gap between known approximation and inapproximability results. Closing this gap is a stimulating challenge.To this end, we consider a regular version of MaxMin Allocation where each agent must receive exactly k goods, for a given integer k. We call this problem k-division. The analysis of this problem allows us to highlight two interesting features of the classical MaxMin Allocation problem. First, we show a close connection of the problem with matroid theory. This connection provides us an exact algorithm for a special case of k-division and a 1/k-approximation algorithm for general inputs. Moreover, we show that the difficulty of the MaxMin Allocation may be caught by an apparently simpler problem, namely the k-division problem in which an agent's utility for a single good can only take one value out of three." @default.
- W1879947412 created "2016-06-24" @default.
- W1879947412 creator A5024158337 @default.
- W1879947412 creator A5044085723 @default.
- W1879947412 creator A5080998576 @default.
- W1879947412 date "2014-05-01" @default.
- W1879947412 modified "2023-10-16" @default.
- W1879947412 title "On regular and approximately fair allocations of indivisible goods" @default.
- W1879947412 cites W1842290172 @default.
- W1879947412 cites W1978593916 @default.
- W1879947412 cites W2005723304 @default.
- W1879947412 cites W2011039300 @default.
- W1879947412 cites W2068859584 @default.
- W1879947412 cites W2078664320 @default.
- W1879947412 cites W2087907759 @default.
- W1879947412 cites W2095794917 @default.
- W1879947412 cites W2123976299 @default.
- W1879947412 cites W2147981433 @default.
- W1879947412 cites W2154014787 @default.
- W1879947412 cites W824171425 @default.
- W1879947412 cites W1525605957 @default.
- W1879947412 cites W2002252750 @default.
- W1879947412 hasPublicationYear "2014" @default.
- W1879947412 type Work @default.
- W1879947412 sameAs 1879947412 @default.
- W1879947412 citedByCount "8" @default.
- W1879947412 countsByYear W18799474122013 @default.
- W1879947412 countsByYear W18799474122014 @default.
- W1879947412 countsByYear W18799474122015 @default.
- W1879947412 countsByYear W18799474122018 @default.
- W1879947412 countsByYear W18799474122019 @default.
- W1879947412 countsByYear W18799474122021 @default.
- W1879947412 crossrefType "proceedings-article" @default.
- W1879947412 hasAuthorship W1879947412A5024158337 @default.
- W1879947412 hasAuthorship W1879947412A5044085723 @default.
- W1879947412 hasAuthorship W1879947412A5080998576 @default.
- W1879947412 hasBestOaLocation W18799474121 @default.
- W1879947412 hasConcept C41008148 @default.
- W1879947412 hasConceptScore W1879947412C41008148 @default.
- W1879947412 hasLocation W18799474121 @default.
- W1879947412 hasLocation W18799474122 @default.
- W1879947412 hasLocation W18799474123 @default.
- W1879947412 hasOpenAccess W1879947412 @default.
- W1879947412 hasPrimaryLocation W18799474121 @default.
- W1879947412 hasRelatedWork W1596801655 @default.
- W1879947412 hasRelatedWork W2130043461 @default.
- W1879947412 hasRelatedWork W2350741829 @default.
- W1879947412 hasRelatedWork W2358668433 @default.
- W1879947412 hasRelatedWork W2376932109 @default.
- W1879947412 hasRelatedWork W2382290278 @default.
- W1879947412 hasRelatedWork W2390279801 @default.
- W1879947412 hasRelatedWork W2748952813 @default.
- W1879947412 hasRelatedWork W2899084033 @default.
- W1879947412 hasRelatedWork W2530322880 @default.
- W1879947412 isParatext "false" @default.
- W1879947412 isRetracted "false" @default.
- W1879947412 magId "1879947412" @default.
- W1879947412 workType "article" @default.