Differentially private fair division

DOI10.1016/J.ARTINT.2025.104385MaRDI QIDQ6933236zbMATH OpenFDO

Authors Pasin Manurangsi, Warut Suksompong

Publication date 5 September 2025

Published in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.ARTINT.2025.104385

Mathematics Subject Classification ID

Privacy of data (68P27) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Cites work

• A note on cake cutting
• A Remark on Stirling's Formula
• Algorithms with more granular differential privacy guarantees
• Almost envy-free allocations with connected bundles
• Almost envy-freeness for groups: improved bounds via discrepancy theory
• Differential privacy under continual observation
• Differential Privacy: A Survey of Results
• EFX exists for three agents
• Fair Allocation of Indivisible Goods
• Fairly allocating contiguous blocks of indivisible items
• How to Cut A Cake Fairly
• scientific article; zbMATH DE number 1234106 (Why is no real title available?)
• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• On the complexity of differentially private data release, efficient algorithms and hardness results
• On the geometry of differential privacy
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• Private matchings and allocations
• The algorithmic foundations of differential privacy
• The complexity of differential privacy
• The price of connectivity in fair division
• Theory of Cryptography
• Weighted fair division of indivisible items: a review

This page was built for publication: Differentially private fair division

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