paper-with-me

홈 › Papers

Rawlsian many-to-one matching with non-linear utility

2025-11-04 · Hortence Nana, Andreas Athanasopoulos, Christos Dimitrakakis arxiv

We study a many-to-one matching problem, such as the college admission problem, where each college can admit multiple students. Unlike classical models, colleges evaluate sets of students through non-linear utility functions that capture diversity between them. In this setting, we show that classical stable matchings may fail to exist. To address this, we propose alternative solution concepts based on Rawlsian fairness, aiming to maximize the minimum utility across colleges. We design both deterministic and stochastic algorithms that iteratively improve the outcome of the worst-off college, offering a practical approach to fair allocation when stability cannot be guaranteed.

📄 PDF Abstract BibTeX arXiv:2511.02533

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Rawlsian Fair Adaptation of Deep Learning Classifiers

2021-05-31 · Kulin Shah, Pooja Gupta, Amit Deshpande, Chiranjib Bhattacharyya

Group-fairness in classification aims for equality of a predictive utility across different sensitive sub-populations, e.g., race or gender. Equality or near-equality constraints in group-fairness often worsen not only t…

Deep LearningFairness

Bandit Learning in Matching Markets: Utilitarian and Rawlsian Perspectives

2024-11-30 · Hadi Hosseini, Duohan Zhang

Two-sided matching markets have demonstrated significant impact in many real-world applications, including school choice, medical residency placement, electric vehicle charging, ride sharing, and recommender systems. How…

Recommendation Systems

From Utilitarian to Rawlsian Designs for Algorithmic Fairness

2023-02-07 · Daniel E. Rigobon

There is a lack of consensus within the literature as to how `fairness' of algorithmic systems can be measured, and different metrics can often be at odds. In this paper, we approach this task by drawing on the ethical f…

Fairness

Rawlsian Fairness in Online Bipartite Matching: Two-sided, Group, and Individual

2022-01-16 · Seyed A. Esmaeili, Sharmila Duppala, Davidson Cheng, Vedant Nanda 외

Online bipartite-matching platforms are ubiquitous and find applications in important areas such as crowdsourcing and ridesharing. In the most general form, the platform consists of three entities: two sides to be matche…

FairnessVocal Bursts Valence Prediction

RawlsGCN: Towards Rawlsian Difference Principle on Graph Convolutional Network

2022-02-28 · Jian Kang, Yan Zhu, Yinglong Xia, Jiebo Luo 외

Graph Convolutional Network (GCN) plays pivotal roles in many real-world applications. Despite the successes of GCN deployment, GCN often exhibits performance disparity with respect to node degrees, resulting in worse pr…