With buffers of size linear in k and number of agents, algorithms achieve EF1 at every step and EF at most steps for personalized k-value mixed manna instances, extending to general additives with ratio dependence.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Online Fair Division Meets Reordering Buffers
With buffers of size linear in k and number of agents, algorithms achieve EF1 at every step and EF at most steps for personalized k-value mixed manna instances, extending to general additives with ratio dependence.