Simultaneously fair allocation of indivisible items across multiple dimensions

DOI10.4230/LIPICS.FSTTCS.2025.41MaRDI QIDQ7391921zbMATH OpenFDO

Authors Yasushi Kawase, Bodhayan Roy, Mohammad Azharuddin Sanpui

Publication date 2025

Copyright license Creative Commons Attribution 4.0 International

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

Mathematics Subject Classification ID

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

Cites work

• Almost envy-freeness for groups: improved bounds via discrepancy theory
• Almost envy-freeness in group resource allocation
• An Envy-Free Cake Division Protocol
• Approximate maximin shares for groups of agents
• Asymptotic existence of fair divisions for groups
• Consensus Halving for Sets of Items
• Democratic fair allocation of indivisible goods
• Envy-free division of multi-layered cakes
• Envy-free two-player \(m\)-cake and three-player two-cake divisions
• Fair cake-cutting among families
• Fair division with allocator's preference
• Fair division with multiple pieces
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On the fair division of a heterogeneous commodity
• On the number of almost envy-free allocations
• The complexity of satisfiability problems
• The probabilistic method
• Two-player envy-free multi-cake division

This page was built for publication: Simultaneously fair allocation of indivisible items across multiple dimensions

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