FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W3124406442> ?p ?o ?g. }

• W3124406442 abstract "We study the problem of allocating divisible bads (chores) among multiple agents with additive utilities when monetary transfers are not allowed. The competitive rule is known for its remarkable fairness and efficiency properties in the case of goods. This rule was extended to chores by Bogomolnaia, Moulin, Sandomirskiy, and Yanovskaya. For both goods and chores, the rule produces Pareto optimal and envy-free allocations. In the case of goods, the outcome of the competitive rule can be easily computed. Competitive allocations solve the Eisenberg-Gale convex program; hence the outcome is unique and can be approximately found by standard gradient methods. An exact algorithm that runs in polynomial time in the number of agents and goods was given by Orlin. In the case of chores, the competitive rule does not solve any convex optimization problem; instead, competitive allocations correspond to local minima, local maxima, and saddle points of the Nash social welfare on the Pareto frontier of the set of feasible utilities. The Pareto frontier may contain many such points and, consequently, the outcome of the competitive rule is no longer unique. In this paper, we show that all the outcomes of the competitive rule for chores can be computed in strongly polynomial time if either the number of agents or the number of chores is fixed. The approach is based on a combination of three ideas: all consumption graphs of Pareto optimal allocations can be listed in polynomial time; for a given consumption graph, a candidate for a competitive utility profile can be constructed via an explicit formula; each candidate can be checked for competitiveness and the allocation can be reconstructed using a maximum flow computation. Our algorithm immediately gives an approximately-fair allocation of indivisible chores by the rounding technique of Barman and Krishnamurthy. Funding: This work was supported by National Science Foundation (CNS 1518941); Lady Davis Fellowship Trust, Hebrew University of Jerusalem; H2020 European Research Council (740435); Linde Institute at Caltech." @default.
• W3124406442 created "2021-02-01" @default.
• W3124406442 creator A5020593618 @default.
• W3124406442 creator A5033056459 @default.
• W3124406442 date "2023-05-10" @default.
• W3124406442 modified "2023-10-18" @default.
• W3124406442 title "Algorithms for Competitive Division of Chores" @default.
• W3124406442 cites W1520462245 @default.
• W3124406442 cites W1600130330 @default.
• W3124406442 cites W1780118416 @default.
• W3124406442 cites W1969725680 @default.
• W3124406442 cites W1980938853 @default.
• W3124406442 cites W1984726588 @default.
• W3124406442 cites W1985717133 @default.
• W3124406442 cites W1991624978 @default.
• W3124406442 cites W2008751404 @default.
• W3124406442 cites W2014437184 @default.
• W3124406442 cites W2014465065 @default.
• W3124406442 cites W2017970485 @default.
• W3124406442 cites W2017990047 @default.
• W3124406442 cites W2042127730 @default.
• W3124406442 cites W2106372733 @default.
• W3124406442 cites W2118846912 @default.
• W3124406442 cites W2150409561 @default.
• W3124406442 cites W2158373208 @default.
• W3124406442 cites W2169359757 @default.
• W3124406442 cites W2508573783 @default.
• W3124406442 cites W2586913291 @default.
• W3124406442 cites W2896904690 @default.
• W3124406442 cites W2949883232 @default.
• W3124406442 cites W3005691527 @default.
• W3124406442 cites W4234277722 @default.
• W3124406442 cites W4252834754 @default.
• W3124406442 cites W4255709949 @default.
• W3124406442 cites W4362223083 @default.
• W3124406442 doi "https://doi.org/10.1287/moor.2023.1361" @default.
• W3124406442 hasPublicationYear "2023" @default.
• W3124406442 type Work @default.
• W3124406442 sameAs 3124406442 @default.
• W3124406442 citedByCount "2" @default.
• W3124406442 countsByYear W31244064422023 @default.
• W3124406442 crossrefType "journal-article" @default.
• W3124406442 hasAuthorship W3124406442A5020593618 @default.
• W3124406442 hasAuthorship W3124406442A5033056459 @default.
• W3124406442 hasBestOaLocation W31244064422 @default.
• W3124406442 hasConcept C126255220 @default.
• W3124406442 hasConcept C134306372 @default.
• W3124406442 hasConcept C137635306 @default.
• W3124406442 hasConcept C144237770 @default.
• W3124406442 hasConcept C148220186 @default.
• W3124406442 hasConcept C186633575 @default.
• W3124406442 hasConcept C2780964549 @default.
• W3124406442 hasConcept C33923547 @default.
• W3124406442 hasConcept C46814582 @default.
• W3124406442 hasConceptScore W3124406442C126255220 @default.
• W3124406442 hasConceptScore W3124406442C134306372 @default.
• W3124406442 hasConceptScore W3124406442C137635306 @default.
• W3124406442 hasConceptScore W3124406442C144237770 @default.
• W3124406442 hasConceptScore W3124406442C148220186 @default.
• W3124406442 hasConceptScore W3124406442C186633575 @default.
• W3124406442 hasConceptScore W3124406442C2780964549 @default.
• W3124406442 hasConceptScore W3124406442C33923547 @default.
• W3124406442 hasConceptScore W3124406442C46814582 @default.
• W3124406442 hasLocation W31244064421 @default.
• W3124406442 hasLocation W31244064422 @default.
• W3124406442 hasOpenAccess W3124406442 @default.
• W3124406442 hasPrimaryLocation W31244064421 @default.
• W3124406442 hasRelatedWork W2057428789 @default.
• W3124406442 hasRelatedWork W2062339879 @default.
• W3124406442 hasRelatedWork W2099359611 @default.
• W3124406442 hasRelatedWork W2272261776 @default.
• W3124406442 hasRelatedWork W3008373916 @default.
• W3124406442 hasRelatedWork W3045038631 @default.
• W3124406442 hasRelatedWork W3084758821 @default.
• W3124406442 hasRelatedWork W3121683625 @default.
• W3124406442 hasRelatedWork W3124486944 @default.
• W3124406442 hasRelatedWork W2343234163 @default.
• W3124406442 isParatext "false" @default.
• W3124406442 isRetracted "false" @default.
• W3124406442 magId "3124406442" @default.
• W3124406442 workType "article" @default.