Cover Image

Online MMS Allocation for Chores

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Song, Jiaxin, Tao, Biaoshuai, Wang, Wenqian, Zhang, Yuhao
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

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

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

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

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

Fair Division with Allocator's Preference
by: Bu, Xiaolin, et al.
Published: (2023)

Approximability Landscape of Welfare Maximization within Fair Allocations
by: Bu, Xiaolin, et al.
Published: (2022)

On Pareto-Optimal and Fair Allocations with Personalized Bi-Valued Utilities
by: Jin, Jiarong, et al.
Published: (2025)

Truthful and Almost Envy-Free Mechanism of Allocating Indivisible Goods: the Power of Randomness
by: Bu, Xiaolin, et al.
Published: (2024)

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

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)

The Incentive Guarantees Behind Nash Welfare in Divisible Resources Allocation
by: Bei, Xiaohui, et al.
Published: (2023)

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)

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

Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods
by: Bu, Xiaolin, et al.
Published: (2024)

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

Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods
by: Bu, Xiaolin, et al.
Published: (2024)

Algorithms and Complexity of Influence Maximization on Directed Acyclic Graphs
by: Liu, Panfeng, et al.
Published: (2026)

Fair and Almost Truthful Mechanisms for Additive Valuations and Beyond
by: Tao, Biaoshuai, et al.
Published: (2023)

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

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

The Degree of (Extended) Justified Representation and Its Optimization
by: Tao, Biaoshuai, et al.
Published: (2024)

Aggregation of Antagonistic Contingent Preferences: When Is It Possible?
by: Deng, Xiaotie, et al.
Published: (2024)

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

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

How to Balance the Load Online When Jobs and Machines Are Both Selfish?
by: Wang, Wenqian, et al.
Published: (2024)

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

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

A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023)

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

Constant Weighted Maximin Share Approximations for Chores
by: Li, Bo, 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)

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

Aggregating Information and Preferences with Bounded-Size Deviations
by: Han, Qishen, et al.
Published: (2025)

The Art of Two-Round Voting
by: Han, Qishen, et al.
Published: (2025)

Strong Equilibria in Bayesian Games with Bounded Group Size
by: Han, Qishen, et al.
Published: (2025)

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