Document Open Access Logo

OWA for Bipartite Assignments

Authors Jabari Hastings , Sigal Oren , Omer Reingold

PDF

File

Thumbnail PDF
PDF
LIPIcs.FORC.2025.21.pdf
  • Filesize: 0.8 MB
  • 20 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Theory of computation → Algorithmic game theory and mechanism design
Keywords
  • fairness
  • matchings
  • approximation algorithms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

In resource allocation problems, a central planner often strives to have a fair assignment. A challenge they might face, however, is that there are several objectives that could be argued to be fair, such as the max-min and maximum social welfare. In this work, we study bipartite assignment problems involving the optimization of a class of functions that is sensitive to the relative utilities derived by individuals in allocation and captures these traditional objectives. One subclass of these functions consists of the "fair" ordered weighted averages (OWA) introduced by Lesca et al. (Algorithmica 2019), which are most sensitive to the utilities received by the worst-off individuals. We show that the task of optimizing an arbitrary function from this subclass belongs to the complexity class FPT, resolving an open question raised by that work; we also provide a polynomial time approximation scheme (PTAS). In addition, we introduce and study another subclass of evaluation functions that targets the average welfare attained within some interval of the economic ladder (e.g., the bottom 10%, middle 50%, or top 80%). We provide an efficient algorithm that can be used to optimize the welfare for an arbitrary interval and also show how the approach can be used to approximate more general evaluation functions.

Cite As Get BibTex

Jabari Hastings, Sigal Oren, and Omer Reingold. OWA for Bipartite Assignments. In 6th Symposium on Foundations of Responsible Computing (FORC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 329, pp. 21:1-21:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.FORC.2025.21

Author Details

Jabari Hastings
  • Stanford University, Stanford, CA, USA
Sigal Oren
  • Ben-Gurion University of the Negev, Beer-Sheva, Israel
Omer Reingold
  • Stanford University, Stanford, CA, USA

Funding

  • Hastings, Jabari: Supported by the Simons Foundation Collaboration on the Theory of Algorithmic Fairness and the Simons Foundation investigators award 689988.
  • Oren, Sigal: Supported in part by BSF grant 2018206.
  • Reingold, Omer: Supported by the Simons Foundation Collaboration on the Theory of Algorithmic Fairness, the Sloan Foundation Grant 2020-13941 and the Simons Foundation investigators award 689988.

Acknowledgements

We thank Shahar Dobzinski and Gergely Csáji for helpful discussions.

References

  1. Fateme Abbasi, Sandip Banerjee, Jarosław Byrka, Parinya Chalermsook, Ameet Gadekar, Kamyar Khodamoradi, Dániel Marx, Roohani Sharma, and Joachim Spoerhase. Parameterized Approximation Schemes for Clustering with General Norm Objectives. In 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS), pages 1377-1399, 2023. URL: https://doi.org/10.1109/FOCS57990.2023.00085.
  2. Atila Abdulkadiroğlu, Parag A Pathak, and Alvin E Roth. The new york city high school match. American Economic Review, 95(2):364-367, 2005. Google Scholar
  3. Hyung-Chan An and Ola Svensson. Recent developments in approximation algorithms for facility location and clustering problems. In Combinatorial Optimization and Graph Algorithms: Communications of NII Shonan Meetings, pages 1-19. Springer, 2017. Google Scholar
  4. Nick Arnosti and Peng Shi. Design of lotteries and wait-lists for affordable housing allocation. Management Science, 66(6):2291-2307, 2020. URL: https://doi.org/10.1287/MNSC.2019.3311.
  5. Deeparnab Chakrabarty and Chaitanya Swamy. Approximation algorithms for minimum norm and ordered optimization problems. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, pages 126-137, Phoenix AZ USA, June 2019. ACM. URL: https://doi.org/10.1145/3313276.3316322.
  6. Shichuan Deng and Qianfan Zhang. Ordered k-Median with Outliers. In Amit Chakrabarti and Chaitanya Swamy, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022), volume 245 of Leibniz International Proceedings in Informatics (LIPIcs), pages 34:1-34:22, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2022.34.
  7. Ashish Goel and Adam Meyerson. Simultaneous Optimization via Approximate Majorization for Concave Profits or Convex Costs. Algorithmica, 44(4):301-323, April 2006. URL: https://doi.org/10.1007/S00453-005-1177-7.
  8. O Gross. The bottleneck assignment problem. Rand, 1959. Google Scholar
  9. S.K. Gupta and A.P. Punnen. k-sum optimization problems. Operations Research Letters, 9(2):121-126, 1990. Google Scholar
  10. Swati Gupta, Jai Moondra, and Mohit Singh. Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees, pages 1136-1165. Society for Industrial and Applied Mathematics, 2025. URL: https://doi.org/10.1137/1.9781611978322.33.
  11. Thomas Kesselheim, Marco Molinaro, and Sahil Singla. Supermodular approximation of norms and applications. In Proceedings of the 56th Annual ACM Symposium on Theory of Computing, pages 1841-1852, 2024. URL: https://doi.org/10.1145/3618260.3649734.
  12. Harold W Kuhn. The hungarian method for the assignment problem. Naval research logistics quarterly, 2(1-2):83-97, 1955. Google Scholar
  13. A. Kumar and J. Kleinberg. Fairness measures for resource allocation. In Proceedings 41st Annual Symposium on Foundations of Computer Science, pages 75-85, 2000. Google Scholar
  14. Julien Lesca, Michel Minoux, and Patrice Perny. The fair owa one-to-one assignment problem: Np-hardness and polynomial time special cases. Algorithmica, 81(1):98-123, January 2019. URL: https://doi.org/10.1007/S00453-018-0434-5.
  15. Albert W. Marshall, Ingram Olkin, and Barry C. Arnold. Inequalities: Theory of Majorization and Its Applications. Springer Series in Statistics. Springer New York, New York, NY, 2011. Google Scholar
  16. M. Minoux. Solving combinatorial problems with combined min-max-min-sum objective and applications. Math. Program., 45(1-3):361-372, August 1989. URL: https://doi.org/10.1007/BF01589111.
  17. John Rawls. A theory of justice. Cambridge (Mass.), 1971. Google Scholar
  18. Alvin E Roth. The origins, history, and design of the resident match. Jama, 289(7):909-912, 2003. Google Scholar
  19. P.T. Sokkalingam and Y.P. Aneja. Lexicographic bottleneck combinatorial problems. Operations Research Letters, 23(1):27-33, 1998. URL: https://doi.org/10.1016/S0167-6377(98)00028-5.
  20. John A Weymark. Generalized gini inequality indices. Mathematical Social Sciences, 1(4):409-430, 1981. URL: https://doi.org/10.1016/0165-4896(81)90018-4.
  21. Ronald R Yager. On ordered weighted averaging aggregation operators in multicriteria decisionmaking. IEEE Transactions on systems, Man, and Cybernetics, 18(1):183-190, 1988. URL: https://doi.org/10.1109/21.87068.
  22. Ronald R. Yager, Janusz Kacprzyk, Gleb Beliakov, and Janusz Kacprzyk, editors. Recent Developments in the Ordered Weighted Averaging Operators: Theory and Practice, volume 265 of Studies in Fuzziness and Soft Computing. Springer Berlin Heidelberg, Berlin, Heidelberg, 2011. Google Scholar
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact