maximin share

Exact and Approximate Maximin Share Allocations in Multi-Graphs AAAI 2026 Online Fair Allocations with Binary Valuations and Beyond AAAI 2026 Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously AAAI 2025 A Little Subsidy Ensures MMS Allocation for Three Agents IJCAI 2025 Fair and Efficient Completion of Indivisible Goods AAAI 2025 Improved Maximin Share Approximations for Chores by Bin Packing AAAI 2025 Improved MMS Approximations for Few Agent Types IJCAI 2025 Maximin Share Guarantees for Few Agents with Subadditive Valuations IJCAI 2025 Settling the Maximin Share Fairness for Scheduling among Groups of Machines ICML 2025 1/2-Approximate MMS Allocation for Separable Piecewise Linear Concave Valuations AAAI 2024 Improved Approximation of Weighted MMS Fairness for Indivisible Chores IJCAI 2024 Ordinal Maximin Guarantees for Group Fair Division IJCAI 2024 Approximating Fair Division on D-Claw-Free Graphs IJCAI 2023 Complexity Results and Exact Algorithms for Fair Division of Indivisible Items: A Survey IJCAI 2023 Fair Allocation of Indivisible Chores: Beyond Additive Costs NeurIPS 2023 Fair Division of a Graph into Compact Bundles IJCAI 2023 Multi-agent Online Scheduling: MMS Allocations for Indivisible Items ICML 2023 New Fairness Concepts for Allocating Indivisible Items IJCAI 2023 On Lower Bounds for Maximin Share Guarantees IJCAI 2023 Ordinal Maximin Share Approximation for Goods (Extended Abstract) IJCAI 2023 Simplification and Improvement of MMS Approximation IJCAI 2023 Improved Maximin Guarantees for Subadditive and Fractionally Subadditive Fair Allocation Problem AAAI 2022 Truthful and Fair Mechanisms for Matroid-Rank Valuations AAAI 2022 Weighted Fairness Notions for Indivisible Items Revisited AAAI 2022 Achieving Proportionality up to the Maximin Item with Indivisible Goods AAAI 2021