Cover Image

Lower Bound for Online MMS Assignment of Indivisible Chores

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Seddighin, Masoud, Seddighin, Saeed
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

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

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

Almost Envy-free Allocation of Indivisible Goods: A Tale of Two Valuations
by: Kaviani, Alireza, et al.
Published: (2024)

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

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

Distortion of Multi-Winner Elections on the Line Metric: The Polar Comparison Rule
by: Babashah, Negar, et al.
Published: (2024)

Metric Distortion with Preference Intensities
by: Abbaszadeh, Mehrad, et al.
Published: (2026)

Tight Bounds On the Distortion of Randomized and Deterministic Distributed Voting
by: Abam, Mohammad Ali, et al.
Published: (2025)

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

Improved Approximate EFX Guarantees for Multigraphs
by: Kaviani, Alireza, et al.
Published: (2025)

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

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

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

Allocating Chores with Restricted Additive Costs: Achieving EFX, MMS, and Efficiency Simultaneously
by: Lin, Zehan, et al.
Published: (2026)

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

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

Bad News for Couples: Tight Lower Bounds for Fair Division of Indivisible Items
by: la Tour, Max Dupré
Published: (2026)

Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings
by: V., Vishwa Prakash H., et al.
Published: (2023)

Random Assignment of Indivisible Goods under Constraints
by: Kawase, Yasushi, et al.
Published: (2022)

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

Existence of MMS Allocations with Mixed Manna
by: Hsu, Kevin
Published: (2024)

Truthful-in-Expectation Mechanisms for MMS Approximation
by: Babaioff, Moshe, et al.
Published: (2026)

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)

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

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

Quantum Pattern Matching with Wildcards
by: Seddighin, Masoud, et al.
Published: (2025)

MMS Approximations Under Additive Leveled Valuations
by: Afshinmehr, Mahyar, et al.
Published: (2024)

Fair Division of Indivisible Items
by: Hsu, Kevin
Published: (2025)

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

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

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

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

Fair and Efficient Completion of Indivisible Goods
by: HV, Vishwa Prakash, et al.
Published: (2024)

Stability in Online Assignment Games
by: Martinez, Emile, et al.
Published: (2025)

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

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

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

Fair and Efficient Allocation of Indivisible Mixed Manna
by: Barman, Siddharth, et al.
Published: (2025)