Matches in SemOpenAlex for { <https://semopenalex.org/work/W3175458960> ?p ?o ?g. }
Showing items 1 to 71 of
71
with 100 items per page.
- W3175458960 endingPage "5602" @default.
- W3175458960 startingPage "5595" @default.
- W3175458960 abstract "We study the problem of fair and efficient allocation of a set of indivisible goods to agents with additive valuations using the popular fairness notions of envy-freeness up to one good (EF1) and equitability up to one good (EQ1) in conjunction with Pareto-optimality (PO). There exists a pseudo-polynomial time algorithm to compute an EF1+PO allocation, and a non-constructive proof of existence of allocations that are both EF1 and fractionally Pareto-optimal (fPO). We present a pseudo-polynomial time algorithm to compute an EF1+fPO allocation, thereby improving the earlier results. Our techniques also enable us to show that an EQ1+fPO allocation always exists when the values are positive, and that it can be computed in pseudo-polynomial time. We also consider the class of k-ary instances where k is a constant, i.e., each agent has at most k different values for the goods. We show that for such instances an EF1+fPO allocation can be computed in polynomial time. When all values are positive, we show that an EQ1+fPO allocation for such instances can be computed in polynomial time. Next, we consider instances where the number of agents is constant, and show that an EF1+PO (also EQ1+PO) allocation can be computed in polynomial time. These results significantly extend the polynomial-time computability beyond the known cases of binary or identical valuations. Further, we show that the problem of computing an EF1+PO allocation polynomial-time reduces to a problem in the complexity class PLS. We also design a polynomial-time algorithm that computes Nash welfare maximizing allocations when there are constantly many agents with constant many different values for the goods." @default.
- W3175458960 created "2021-07-05" @default.
- W3175458960 creator A5049544227 @default.
- W3175458960 creator A5077432617 @default.
- W3175458960 date "2021-05-18" @default.
- W3175458960 modified "2023-09-27" @default.
- W3175458960 title "On Fair and Efficient Allocations of Indivisible Goods" @default.
- W3175458960 doi "https://doi.org/10.1609/aaai.v35i6.16703" @default.
- W3175458960 hasPublicationYear "2021" @default.
- W3175458960 type Work @default.
- W3175458960 sameAs 3175458960 @default.
- W3175458960 citedByCount "2" @default.
- W3175458960 countsByYear W31754589602022 @default.
- W3175458960 countsByYear W31754589602023 @default.
- W3175458960 crossrefType "journal-article" @default.
- W3175458960 hasAuthorship W3175458960A5049544227 @default.
- W3175458960 hasAuthorship W3175458960A5077432617 @default.
- W3175458960 hasBestOaLocation W31754589601 @default.
- W3175458960 hasConcept C111919701 @default.
- W3175458960 hasConcept C114614502 @default.
- W3175458960 hasConcept C126255220 @default.
- W3175458960 hasConcept C134306372 @default.
- W3175458960 hasConcept C137635306 @default.
- W3175458960 hasConcept C154945302 @default.
- W3175458960 hasConcept C177264268 @default.
- W3175458960 hasConcept C199360897 @default.
- W3175458960 hasConcept C2777027219 @default.
- W3175458960 hasConcept C2777212361 @default.
- W3175458960 hasConcept C2778701210 @default.
- W3175458960 hasConcept C311688 @default.
- W3175458960 hasConcept C33923547 @default.
- W3175458960 hasConcept C41008148 @default.
- W3175458960 hasConcept C90119067 @default.
- W3175458960 hasConcept C98045186 @default.
- W3175458960 hasConceptScore W3175458960C111919701 @default.
- W3175458960 hasConceptScore W3175458960C114614502 @default.
- W3175458960 hasConceptScore W3175458960C126255220 @default.
- W3175458960 hasConceptScore W3175458960C134306372 @default.
- W3175458960 hasConceptScore W3175458960C137635306 @default.
- W3175458960 hasConceptScore W3175458960C154945302 @default.
- W3175458960 hasConceptScore W3175458960C177264268 @default.
- W3175458960 hasConceptScore W3175458960C199360897 @default.
- W3175458960 hasConceptScore W3175458960C2777027219 @default.
- W3175458960 hasConceptScore W3175458960C2777212361 @default.
- W3175458960 hasConceptScore W3175458960C2778701210 @default.
- W3175458960 hasConceptScore W3175458960C311688 @default.
- W3175458960 hasConceptScore W3175458960C33923547 @default.
- W3175458960 hasConceptScore W3175458960C41008148 @default.
- W3175458960 hasConceptScore W3175458960C90119067 @default.
- W3175458960 hasConceptScore W3175458960C98045186 @default.
- W3175458960 hasIssue "6" @default.
- W3175458960 hasLocation W31754589601 @default.
- W3175458960 hasOpenAccess W3175458960 @default.
- W3175458960 hasPrimaryLocation W31754589601 @default.
- W3175458960 hasRelatedWork W1491338215 @default.
- W3175458960 hasRelatedWork W1493202049 @default.
- W3175458960 hasRelatedWork W1565452214 @default.
- W3175458960 hasRelatedWork W1993518163 @default.
- W3175458960 hasRelatedWork W2025258469 @default.
- W3175458960 hasRelatedWork W2058889384 @default.
- W3175458960 hasRelatedWork W2060490057 @default.
- W3175458960 hasRelatedWork W2316613179 @default.
- W3175458960 hasRelatedWork W245150611 @default.
- W3175458960 hasRelatedWork W2943856120 @default.
- W3175458960 hasVolume "35" @default.
- W3175458960 isParatext "false" @default.
- W3175458960 isRetracted "false" @default.
- W3175458960 magId "3175458960" @default.
- W3175458960 workType "article" @default.