Constant Weighted Maximin Share Approximations for Chores

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Bo, Wang, Fangxiao, Xing, Shiji
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

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

A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
by: Li, Bo, et al.
Published: (2024)

When is Truthfully Allocating Chores no Harder than Goods?
by: Li, Bo, et al.
Published: (2025)

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

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

Constant-Factor EFX Exists for Chores
by: Garg, Jugal, et al.
Published: (2024)

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

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

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

Approximate Envy-Free Allocations up to any $k$ Goods
by: Filos-Ratsikas, Aris, et al.
Published: (2026)

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

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

Maximin Share Guarantees for Few Agents with Subadditive Valuations
by: Christodoulou, George, et al.
Published: (2025)

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

Approximately EFX and PO Allocations for Bivalued Chores
by: Lin, Zehan, et al.
Published: (2025)

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

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)

Weighted EF1 and PO Allocations with Few Types of Agents or Chores
by: Garg, Jugal, et al.
Published: (2024)

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

Online MMS Allocation for Chores
by: Song, Jiaxin, et al.
Published: (2025)

Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms
by: Afshinmehr, Mahyar, et al.
Published: (2024)

A Complete Landscape of EFX Allocations on Graphs: Goods, Chores and Mixed Manna
by: Li, Bo, et al.
Published: (2024)

On the Subsidy of Envy-Free Orientations in Graphs
by: Li, Bo, et al.
Published: (2025)

Distribution of Chores with Information Asymmetry
by: Hosseini, Hadi, et al.
Published: (2023)

Existence of 2-EFX Allocations of Chores
by: Garg, Jugal, et al.
Published: (2025)

Equitable Allocations of Mixtures of Goods and Chores
by: Hosseini, Hadi, et al.
Published: (2025)

Tâtonnement Dynamics for Fisher Markets with Chores
by: Chaudhury, Bhaskar Ray, et al.
Published: (2025)

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

Fair Interval Scheduling of Indivisible Chores
by: Equbal, Sarfaraz, et al.
Published: (2024)

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

Fair Division with Indivisible Goods, Chores, and Cake
by: Aziz, Haris, et al.
Published: (2025)

Proportional and Pareto-Optimal Allocation of Chores with Subsidy
by: Garg, Jugal, et al.
Published: (2025)

Existence of Fair and Efficient Allocation of Indivisible Chores
by: Mahara, Ryoga
Published: (2025)

Fair Assignment of Indivisible Chores to Asymmetric Agents
by: Seddighin, Masoud, et al.
Published: (2025)

Lower Bound for Online MMS Assignment of Indivisible Chores
by: Seddighin, Masoud, et al.
Published: (2025)

On the Fairness of Normalized p-Means for Allocating Goods and Chores
by: Eckart, Owen, et al.
Published: (2024)

Constant-Approximate and Constant-Strategyproof Two-Facility Location
by: Fullerton, Elijah Journey, et al.
Published: (2025)

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

On the Existence of Fair Allocations for Goods and Chores under Dissimilar Preferences
by: Gagushin, Egor, et al.
Published: (2025)