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

Matroid constrained fair allocation problem

Biswas, A and Barman, S (2019) Matroid constrained fair allocation problem. In: 33rd AAAI Conference on Artificial Intelligence, 27 January - 1 February 2019, Honolulu, pp. 9921-9922.

[img] PDF
EAAI_2019.pdf - Published Version
Restricted to Registered users only

Download (259kB) | Request a copy
Official URL: https://doi.org/10.1609/aaai.v33i01.33019921


We consider the problem of allocating a set of indivisible goods among a group of homogeneous agents under matroid constraints and additive valuations, in a fair manner. We propose a novel algorithm that computes a fair allocation for instances with additive and identical valuations, even under matroid constraints. Our result provides a computational anchor to the existential result of the fairness notion, called EF1 (envy-free up to one good) by Biswas and Barman in this setting. We further provide examples to show that the fairness notions stronger than EF1 does not always exist in this setting.

Item Type: Conference Paper
Publication: 33rd AAAI Conference on Artificial Intelligence, AAAI 2019, 31st Innovative Applications of Artificial Intelligence Conference, IAAI 2019 and the 9th AAAI Symposium on Educational Advances in Artificial Intelligence, EAAI 2019
Publisher: AAAI Press
Additional Information: The copyright for this article belongs to AAAI Press
Department/Centre: Division of Electrical Sciences > Computer Science & Automation
Date Deposited: 02 Dec 2022 10:03
Last Modified: 02 Dec 2022 10:03
URI: https://eprints.iisc.ac.in/id/eprint/78142

Actions (login required)

View Item View Item