Cover Image

Proportional and Pareto-Optimal Allocation of Chores with Subsidy

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Garg, Jugal, Sharma, Eklavya, Wu, Xiaowei
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

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

Exploring Relations among Fairness Notions in Discrete Fair Division
by: Garg, Jugal, et al.
Published: (2025)

EF1 for Mixed Manna with Unequal Entitlements
by: Garg, Jugal, et al.
Published: (2024)

Best-of-Both-Worlds Fairness of the Envy-Cycle-Elimination Algorithm
by: Garg, Jugal, et al.
Published: (2024)

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

New Fairness Concepts for Allocating Indivisible Items
by: Caragiannis, Ioannis, et al.
Published: (2022)

Tree Splitting Based Rounding Scheme for Weighted Proportional Allocations with Subsidy
by: Wu, Xiaowei, et al.
Published: (2024)

Revenue-Optimal Pricing for Budget-Constrained Buyers in Data Markets
by: Chaudhury, Bhaskar Ray, et al.
Published: (2026)

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

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

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

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

Matching Markets with Chores
by: Garg, Jugal, et al.
Published: (2024)

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

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

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

Proportionally Fair Makespan Approximation
by: Feldman, Michal, et al.
Published: (2024)

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

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

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

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

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

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

Weighted Envy-free Allocation with Subsidy
by: Aziz, Haris, 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 Existence of Fair Allocations for Goods and Chores under Dissimilar Preferences
by: Gagushin, Egor, et al.
Published: (2025)

Robust Resource Allocation via Competitive Subsidies
by: Lin, David X., et al.
Published: (2025)

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

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

Optimal Reward Allocation via Proportional Splitting
by: Aumayr, Lukas, et al.
Published: (2025)

Limited-Trust in Social Network Games
by: Murray, Timothy, et al.
Published: (2021)

Envy-Free House Allocation with Minimum Subsidy
by: Choo, Davin, et al.
Published: (2024)

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

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

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)

Designing Truthful Mechanisms for Asymptotic Fair Division
by: Garg, Jugal, et al.
Published: (2025)

Online Fair Division With Subsidy: When Do Envy-Free Allocations Exist, and at What Cost?
by: Kulkarni, Pooja, et al.
Published: (2025)

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