Diverse fair allocations: complexity and algorithms

DOI10.1007/978-3-031-25211-2_8OpenAlexW4318023068MaRDI QIDQ6174441FDOQ6174441

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

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

zbMATH Keywords

fair divisionsymmetric allocationsdisjoint allocationsdiverse solutions

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites Work

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

Cited In (6)

• Optimization problems in fair division theory.
• Title not available (Why is that?)
• Fairness and group-strategyproofness clash in assignment problems
• Diverse fair allocations: complexity and algorithms
• Communication complexity of discrete fair division
• An efficient primal-dual algorithm for fair combinatorial optimization problems

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)