Diverse fair allocations: complexity and algorithms

DOI10.1007/978-3-031-25211-2_8MaRDI QIDQ6174441zbMATH OpenOpenAlexFDO

Authors Harshil Mittal, Saraswati Girish Nanoti, Aditi Sethia

Publication date 17 August 2023

Published in Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-25211-2_8

zbMATH Keywords

disjoint allocationsdiverse solutionsfair divisionsymmetric allocations

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Diverse fair allocations: complexity and algorithms
• On the Complexity of Efficiency and Envy-Freeness in Fair Division of Indivisible Goods with Additive Preferences
• On fair division for indivisible items
• Communication complexity of discrete fair division
• On the complexity of fair house allocation

Cites work

• Disjoint stable matchings in linear time
• How to Cut A Cake Fairly
• How to select a small set of diverse solutions to mixed integer programming problems
• On Fair Division under Heterogeneous Matroid Constraints
• On the number of almost envy-free allocations

Cited in

(7)

• An efficient primal-dual algorithm for fair combinatorial optimization problems
• Optimization problems in fair division theory.
• Fairness and group-strategyproofness clash in assignment problems
• Fair Packing of Independent Sets
• scientific article; zbMATH DE number 6466174 (Why is no real title available?)
• Diverse fair allocations: complexity and algorithms
• Communication complexity of discrete fair division

This page was built for publication: Diverse fair allocations: complexity and algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6174441)