Threshold-based algorithms achieve simultaneous constant class envy-freeness and better-than-1/2 utilitarian social welfare in online class matching, with a nearly matching upper bound on the price of fairness.
Online Fair Division: analysing a Food Bank problem
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We study an online model of fair division designed to capture features of a real world charity problem. We consider two simple mechanisms for this model in which agents simply declare what items they like. We analyse several axiomatic properties of these mechanisms like strategy-proofness and envy-freeness. Finally, we perform a competitive analysis and compute the price of anarchy.
fields
cs.GT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Beyond the Half-Approximation: Fair and Efficient Online Class Matching
Threshold-based algorithms achieve simultaneous constant class envy-freeness and better-than-1/2 utilitarian social welfare in online class matching, with a nearly matching upper bound on the price of fairness.