Maximin Share Guarantees for Few Agents with Subadditive Valuations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Christodoulou, George, Christoforidis, Vasilis, Mastrakoulis, Symeon, Sgouritsa, Alkmini
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Improving the Price of Anarchy via Predictions in Parallel-Link Networks
by: Christodoulou, George, et al.
Published: (2025)

Fair and Truthful Allocations Under Leveled Valuations
by: Christodoulou, George, et al.
Published: (2024)

Exact and approximate maximin share allocations in multi-graphs
by: Christodoulou, George, et al.
Published: (2025)

Mechanism design augmented with output advice
by: Christodoulou, George, et al.
Published: (2024)

EF2X Exists For Four Agents
by: Ashuri, Arash, et al.
Published: (2024)

Improved Maximin Share Guarantee for Additive Valuations
by: Heidari, Ehsan, et al.
Published: (2025)

Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem
by: Seddighin, Masoud, et al.
Published: (2025)

A Note on EFX Inapproximability for Chores
by: Christoforidis, Vasilis
Published: (2026)

On the existence of EFX allocations in multigraphs
by: Sgouritsa, Alkmini, et al.
Published: (2025)

Improving Approximation Guarantees for Maximin Share
by: Akrami, Hannaneh, et al.
Published: (2023)

On The Pursuit of EFX for Chores: Non-Existence and Approximations
by: Christoforidis, Vasilis, et al.
Published: (2024)

Simultaneous Ordinal Maximin Share and Envy-Based Guarantees
by: Akrami, Hannaneh, et al.
Published: (2026)

Achieving Maximin Share and EFX/EF1 Guarantees Simultaneously
by: Akrami, Hannaneh, et al.
Published: (2024)

Maximin Share Guarantees via Limited Cost-Sensitive Sharing
by: Salavcova, Hana, et al.
Published: (2026)

Pushing the Frontier on Approximate EFX Allocations
by: Amanatidis, Georgios, et al.
Published: (2024)

Compatibility of Fairness and Nash Welfare under Subadditive Valuations
by: Barman, Siddharth, et al.
Published: (2024)

Counterexamples to EFX for Submodular and Subadditive Valuations
by: Mackenzie, Simon, et al.
Published: (2026)

Maximin Shares with Lower Quotas
by: Kinoshita, Hirota, et al.
Published: (2026)

Ordinal Maximin Guarantees for Group Fair Division
by: Manurangsi, Pasin, et al.
Published: (2024)

Constant Weighted Maximin Share Approximations for Chores
by: Li, Bo, et al.
Published: (2025)

Exact Maximin Share Fairness via Adjusted Supply
by: Barman, Siddharth, et al.
Published: (2025)

Improved Maximin Share Approximations for Chores by Bin Packing
by: Garg, Jugal, et al.
Published: (2024)

Static Nuel Games with Terminal Payoff
by: Mastrakoulis, S., et al.
Published: (2024)

Bin Packing and Covering: Pushing the Frontier on the Maximin Share Fairness
by: Li, Bo, et al.
Published: (2025)

The Price of EF1 for Few Agents with Additive Ternary Valuations
by: Kyropoulou, Maria, et al.
Published: (2025)

Maximin Shares in Hereditary Set Systems
by: Hummel, Halvard
Published: (2024)

An FPTAS for 7/9-Approximation to Maximin Share Allocations
by: Huang, Xin, et al.
Published: (2025)

Utilitarian Guarantees for the Method of Equal Shares
by: Baychkov, Anton, et al.
Published: (2025)

Maximin Fair Allocation of Indivisible Items under Cost Utilities
by: Botan, Sirin, et al.
Published: (2024)

On the Fair Allocation to Asymmetric Agents with Binary XOS Valuations
by: Chen, Ziheng, et al.
Published: (2026)

Online Resource Sharing: Better Robust Guarantees via Randomized Strategies
by: Lin, David X., et al.
Published: (2025)

Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations
by: Bismuth, Samuel, et al.
Published: (2019)

Maximin Relative Improvement: Fair Learning as a Bargaining Problem
by: Han, Jiwoo, et al.
Published: (2026)

Simultaneously Satisfying MXS and EFL
by: Ashuri, Arash, et al.
Published: (2024)

Existence of EFX for Two Additive Valuations
by: Mahara, Ryoga
Published: (2020)

Optimal Type-Dependent Liquid Welfare Guarantees for Autobidding Agents with Budgets
by: Colini-Baldeschi, Riccardo, et al.
Published: (2025)

Guaranteeing MMS for All but One Agent When Allocating Indivisible Chores
by: Qiu, Jiawei, et al.
Published: (2024)

Envy Cycle Elimination with Strategic Agents: Best Responses and Fairness Guarantees
by: Amanatidis, Georgios, et al.
Published: (2026)

Stable Matching under Matroid Rank Valuations
by: Eden, Alon, et al.
Published: (2025)

Maximum Welfare Allocations under Quantile Valuations
by: Aziz, Haris, et al.
Published: (2025)