[. References and . Barman, Siddharth Barman, Arpita Biswas, Sanath Kumar Krishnamurthy, and Yadati Narahari, 2018.

. Barman, Eric Budish. The combinatorial assignment problem: Approximate competitive equilibrium from equal incomes, Proc. ACM FAT*, vol.12, pp.575-592, 2010.

K. Foley-;-duncan, ;. Foley, J. Garey, R. Michael, D. S. Garey et al., Preventing fairness gerrymandering: Auditing and learning for subgroup fairness, Proc. NIPS, vol.7, pp.2564-2572, 1967.

H. W. Kuhn, The Hungarian method for the assignment problem, Naval Research Logistics (NRL), vol.2, pp.83-97, 1955.

P. Lahaie and D. Lipton, Approximation algorithms and hardness results for fair division with indivisible goods, Munkres, 1957] James Munkres, vol.367, pp.386-392, 1957.

R. R. Yager and . Yager, On Ordered Weighted Averaging aggregation operators in multicriteria decision making, IEEE Transactions on Systems, Man, and Cybernetics, vol.18, issue.1, pp.183-190, 1988.

L. Zhou and . Zhou, Strictly fair allocations in large exchange economies, Journal of Economic Theory, vol.57, issue.1, pp.158-175, 1992.