Publisher
Springer Nature Switzerland
Reference58 articles.
1. Agarwal, A., Beygelzimer, A., Dudík, M., Langford, J., Wallach, H.: A reductions approach to fair classification. In: International Conference on Machine Learning, pp. 60–69. PMLR (2018)
2. Amaldi, E., Coniglio, S., Gianoli, L.G., Ileri, C.U.: On single-path network routing subject to max-min fair flow allocation. Electron. Notes Discrete Math. 41, 543–550 (2013)
3. Bei, X., Liu, S., Poon, C.K., Wang, H.: Candidate selections with proportional fairness constraints. Auton. Agent. Multi-Agent Syst. 36(1), 1–32 (2022)
4. Beynier, A., et al.: Local envy-freeness in house allocation problems. Auton. Agent. Multi-Agent Syst. 33(5), 591–627 (2019)
5. Brams, S.J., Taylor, A.D.: Fair Division: From Cake-Cutting to Dispute Resolution. Cambridge University Press, Cambridge, March 1996