ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

On Achieving Leximin Fairness and Stability in Many-to-One Matchings

Narang, S and Biswas, A and Narahari, Y (2022) On Achieving Leximin Fairness and Stability in Many-to-One Matchings. In: 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022, 9 - 13 May 2022, Auckland, Virtual, pp. 1705-1707.

[img] PDF
AAMAS 2022_3_1705-1707_2022.pdf - Published Version
Restricted to Registered users only

Download (913kB) | Request a copy
Official URL: https://dl.acm.org/doi/10.5555/3535850.3536083

Abstract

The past few years have seen a surge of work on fairness in allocation problems where items must be fairly divided among agents having individual preferences. In comparison, fairness in matching settings with preferences on both sides, that is, where agents have to be matched to other agents, has received much less attention. Moreover, the two-sided matching literature has largely focused on ordinal preferences. We study leximin optimality over stable many-to-one matchings under cardinal preferences. We first investigate matching problems with ranked valuations for which we give efficient algorithms to find the leximin optimal matching over the space of stable matchings. We complement these results by showing that relaxing the ranked valuations condition in any way, makes finding the leximin optimal stable matching intractable.

Item Type: Conference Paper
Publication: Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
Publisher: International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS)
Additional Information: The copyright for this article belongs to the International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS).
Keywords: Multi agent systems, Allocation problems; Fairness, stability; Individual preference; Leximin; Leximin optimality; Many-to-one; Many-to-one matching; Matchings; Optimality; Stable matching, Autonomous agents
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 04 Aug 2022 11:30
Last Modified: 04 Aug 2022 11:30
URI: https://eprints.iisc.ac.in/id/eprint/75341

Actions (login required)

View Item View Item