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.
The unreasonable fairness of maximum nash welfare.ACM Transactions on Economics and Computation (TEAC), 7(3):1–32
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
-
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.