Polynomial-time algorithm for EF1 and maximal chore scheduling for two agents on interval graphs; existence via cycle-plus-triangles for identical valuations on paths; algorithm for dichotomous valuations with four or more agents.
Course Match: A Large-Scale Implementation of Approximate Competitive Equilibrium from Equal Incomes for Combinatorial Allocation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fair Interval Scheduling of Indivisible Chores
Polynomial-time algorithm for EF1 and maximal chore scheduling for two agents on interval graphs; existence via cycle-plus-triangles for identical valuations on paths; algorithm for dichotomous valuations with four or more agents.