Bin Packing and Covering: Pushing the Frontier on the Maximin Share Fairness

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Li, Bo, Sun, Ankang, Wang, Zunyu, Zhou, Yu
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)

Fair Orientations: Proportionality and Equitability
by: Sun, Ankang, et al.
Published: (2026)

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)

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

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

Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency
by: Sun, Ankang, et al.
Published: (2024)

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

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

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

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)

The (Exact) Price of Cardinality for Indivisible Goods: A Parametric Perspective
by: Lam, Alexander, et al.
Published: (2025)

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

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

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

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

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

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

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

Multi-Agent Non-Discriminatory Contracts
by: Ding, Ke, et al.
Published: (2026)

Bounding the Price-of-Fair-Sharing using Knapsack-Cover Constraints to guide Near-Optimal Cost-Recovery Algorithms
by: Aarts, Sander, et al.
Published: (2023)

Fair Division via the Cake-Cutting Share
by: Bai, Yannan, et al.
Published: (2024)

Bridging Theory and Perception in Fair Division: A Study on Comparative and Fair Share Notions
by: Hosseini, Hadi, et al.
Published: (2025)

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

Fairness in Repeated Matching: A Maximin Perspective
by: Lim, Eugene, et al.
Published: (2025)

Facility Assignment with Fair Cost Sharing: Equilibrium and Mechanism Design
by: Ma, Mengfan, et al.
Published: (2024)

Multi-Item Screening with a Maximin-Ratio Objective
by: Wang, Shixin
Published: (2024)

Allocating Mixed Goods with Customized Fairness and Indivisibility Ratio
by: Li, Bo, et al.
Published: (2024)

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

Share-Based Fairness for Arbitrary Entitlements
by: Babaioff, Moshe, et al.
Published: (2024)

Incentivizing Time-Aware Fairness in Data Sharing
by: Chen, Jiangwei, et al.
Published: (2025)

Temporal Fair Division of Indivisible Goods with Scheduling
by: Choi, Kui-Wang, et al.
Published: (2026)

Fair Contracts
by: Castiglioni, Matteo, et al.
Published: (2025)

Incentive Analysis of Collusion in Fair Division
by: Huang, Haoqiang, et al.
Published: (2025)

Fair Team Contracts
by: Castiglioni, Matteo, et al.
Published: (2025)

Ultra Efficient Contracts: Pushing the Boundaries of Tractable Contract Design
by: Feldman, Michal, et al.
Published: (2025)

Check, Please: Verifiably Fair Clustering
by: He, Yu, et al.
Published: (2026)

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