Improving Envy Freeness up to Any Good Guarantees Through Rainbow Cycle Number
- 1 November 2024
- journal article
- research article
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Mathematics of Operations Research
- Vol. 49 (4) , 2323-2340
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Fair EnoughJournal of the ACM, 2018
- Approximating the Nash Social Welfare with Indivisible ItemsSIAM Journal on Computing, 2018
- Approximation Algorithms for Computing Maximin Share AllocationsACM Transactions on Algorithms, 2017
- Maximin Envy-Free Division of Indivisible ItemsGroup Decision and Negotiation, 2016
- Fair assignment of indivisible objects under ordinal preferencesArtificial Intelligence, 2015
- Characterizing conflicts in fair division of indivisible goods using a scale of criteriaAutonomous Agents and Multi-Agent Systems, 2015
- Parameterized Algorithms2015
- The Combinatorial Assignment Problem: Approximate Competitive Equilibrium from Equal IncomesJournal of Political Economy, 2011
- Color-codingJournal of the ACM, 1995
- Sur la division pragmatiqueEconometrica, 1949