Group Fairness and Multi-criteria Optimization in School Assignment
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909588609040384 |
|---|---|
| author | A., Santhini K. Munagala, Kamesh Nasre, Meghana Sankar, Govind S. |
| author_facet | A., Santhini K. Munagala, Kamesh Nasre, Meghana Sankar, Govind S. |
| contents | We consider the problem of assigning students to schools, when students have different utilities for schools and schools have capacity. There are additional group fairness considerations over students that can be captured either by concave objectives, or additional constraints on the groups. We present approximation algorithms for this problem via convex program rounding that achieve various trade-offs between utility violation, capacity violation, and running time. We also show that our techniques easily extend to the setting where there are arbitrary covering constraints on the feasible assignment, capturing multi-criteria and ranking optimization. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_15623 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Group Fairness and Multi-criteria Optimization in School Assignment A., Santhini K. Munagala, Kamesh Nasre, Meghana Sankar, Govind S. Data Structures and Algorithms Computer Science and Game Theory We consider the problem of assigning students to schools, when students have different utilities for schools and schools have capacity. There are additional group fairness considerations over students that can be captured either by concave objectives, or additional constraints on the groups. We present approximation algorithms for this problem via convex program rounding that achieve various trade-offs between utility violation, capacity violation, and running time. We also show that our techniques easily extend to the setting where there are arbitrary covering constraints on the feasible assignment, capturing multi-criteria and ranking optimization. |
| title | Group Fairness and Multi-criteria Optimization in School Assignment |
| topic | Data Structures and Algorithms Computer Science and Game Theory |
| url | https://arxiv.org/abs/2403.15623 |