Parameterized complexity of incomplete connected fair division

DOI10.4230/LIPICS.FSTTCS.2023.14MaRDI QIDQ6951724zbMATH OpenFDO

Authors Harmender Gahlawat, Meirav Zehavi

Publication date 28 July 2025

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.FSTTCS.2023.14

zbMATH Keywords

connected fair allocationfair divisionfixed parameter tractabilitykernelization

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Theory of computing (68Qxx)

Cites work

• A Little Charity Guarantees Almost Envy-Freeness
• Almost envy-free allocations with connected bundles
• Almost envy-freeness with general valuations
• Color-coding
• Course bidding at business schools
• Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
• Fair division of indivisible items
• Fair enough: guaranteeing approximate maximin shares
• scientific article; zbMATH DE number 1261820 (Why is no real title available?)
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• Incompressibility through Colors and IDs
• Kernelization. Theory of parameterized preprocessing
• Losing weight by gaining edges
• Parameterized algorithms
• Parameterized complexity of envy-free resource allocation in social networks
• The design of approximation algorithms

This page was built for publication: Parameterized complexity of incomplete connected fair division

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