Improved Maximin Share Approximations for Chores by Bin Packing
Fuente:
arXiv
Saved in:
| Main Authors: | Garg, Jugal, Huang, Xin, Segal-Halevi, Erel |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023)
by: Huang, Xin, et al.
Published: (2023)
Improving Approximation Guarantees for Maximin Share
by: Akrami, Hannaneh, et al.
Published: (2023)
by: Akrami, Hannaneh, et al.
Published: (2023)
Constant Weighted Maximin Share Approximations for Chores
by: Li, Bo, et al.
Published: (2025)
by: Li, Bo, et al.
Published: (2025)
Bin Packing and Covering: Pushing the Frontier on the Maximin Share Fairness
by: Li, Bo, et al.
Published: (2025)
by: Li, Bo, et al.
Published: (2025)
Perpetual Fully-Online Approximate Fairness
by: Kahana, Ido, et al.
Published: (2026)
by: Kahana, Ido, et al.
Published: (2026)
Existence of 2-EFX Allocations of Chores
by: Garg, Jugal, et al.
Published: (2025)
by: Garg, Jugal, et al.
Published: (2025)
Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations
by: Bismuth, Samuel, et al.
Published: (2019)
by: Bismuth, Samuel, et al.
Published: (2019)
Perpetually Fair Assignments Via Balanced Sequences of Permutations
by: Adams, Terrence, et al.
Published: (2026)
by: Adams, Terrence, et al.
Published: (2026)
Constant-Factor EFX Exists for Chores
by: Garg, Jugal, et al.
Published: (2024)
by: Garg, Jugal, et al.
Published: (2024)
Computing Welfare-Maximizing Fair Allocations of Indivisible Goods
by: Aziz, Haris, et al.
Published: (2020)
by: Aziz, Haris, et al.
Published: (2020)
Proportional and Pareto-Optimal Allocation of Chores with Subsidy
by: Garg, Jugal, et al.
Published: (2025)
by: Garg, Jugal, et al.
Published: (2025)
Weighted EF1 and PO Allocations with Few Types of Agents or Chores
by: Garg, Jugal, et al.
Published: (2024)
by: Garg, Jugal, et al.
Published: (2024)
Fair Allocation of Improvements: When Old Endowments Shape New Assignments
by: Elmalem, Noga Klein, et al.
Published: (2025)
by: Elmalem, Noga Klein, et al.
Published: (2025)
Matching Markets with Chores
by: Garg, Jugal, et al.
Published: (2024)
by: Garg, Jugal, et al.
Published: (2024)
Computing approximate roots of monotone functions
by: Hollender, Alexandros, et al.
Published: (2023)
by: Hollender, Alexandros, et al.
Published: (2023)
Weighted Fairness Notions for Indivisible Items Revisited
by: Chakraborty, Mithun, et al.
Published: (2021)
by: Chakraborty, Mithun, et al.
Published: (2021)
What Are People's Actual Utility Functions in Budget Aggregation?
by: Amster, Ayelet, et al.
Published: (2025)
by: Amster, Ayelet, et al.
Published: (2025)
An FPTAS for 7/9-Approximation to Maximin Share Allocations
by: Huang, Xin, et al.
Published: (2025)
by: Huang, Xin, et al.
Published: (2025)
Fair Allocation with Money: What is Your Objective?
by: Elmalem, Noga Klein, et al.
Published: (2025)
by: Elmalem, Noga Klein, et al.
Published: (2025)
Efficiently Computing Equilibria in Budget-Aggregation Games
by: Becker, Patrick, et al.
Published: (2025)
by: Becker, Patrick, et al.
Published: (2025)
It's Not All Black and White: Degree of Truthfulness for Risk-Avoiding Agents
by: Hartman, Eden, et al.
Published: (2025)
by: Hartman, Eden, et al.
Published: (2025)
Weighted Envy Freeness With Bounded Subsidies
by: Elmalem, Noga Klein, et al.
Published: (2024)
by: Elmalem, Noga Klein, et al.
Published: (2024)
The Min Max Average Cycle Weight Problem
by: Elmalem, Noga Klein, et al.
Published: (2025)
by: Elmalem, Noga Klein, et al.
Published: (2025)
Improved Maximin Share Guarantee for Additive Valuations
by: Heidari, Ehsan, et al.
Published: (2025)
by: Heidari, Ehsan, et al.
Published: (2025)
Optimal Budget Aggregation with Star-Shaped Preference Domains
by: Brandt, Felix, et al.
Published: (2024)
by: Brandt, Felix, et al.
Published: (2024)
Coordinating Charitable Donations with Leontief Preferences
by: Brandt, Felix, et al.
Published: (2023)
by: Brandt, Felix, et al.
Published: (2023)
Maximin Shares with Lower Quotas
by: Kinoshita, Hirota, et al.
Published: (2026)
by: Kinoshita, Hirota, et al.
Published: (2026)
Fairly Wired: Towards Leximin-Optimal Division of Electricity
by: Hartman, Eden, et al.
Published: (2025)
by: Hartman, Eden, et al.
Published: (2025)
On Connected Strongly-Proportional Cake-Cutting
by: Jankó, Zsuzsanna, et al.
Published: (2023)
by: Jankó, Zsuzsanna, et al.
Published: (2023)
Improved MMS Approximations for Few Agent Types
by: Garg, Jugal, et al.
Published: (2025)
by: Garg, Jugal, et al.
Published: (2025)
Reducing Leximin Fairness to Utilitarian Optimization
by: Hartman, Eden, et al.
Published: (2024)
by: Hartman, Eden, et al.
Published: (2024)
Proportionally Fair Makespan Approximation
by: Feldman, Michal, et al.
Published: (2024)
by: Feldman, Michal, et al.
Published: (2024)
Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms
by: Afshinmehr, Mahyar, et al.
Published: (2024)
by: Afshinmehr, Mahyar, et al.
Published: (2024)
Exact Maximin Share Fairness via Adjusted Supply
by: Barman, Siddharth, et al.
Published: (2025)
by: Barman, Siddharth, et al.
Published: (2025)
Simultaneous Ordinal Maximin Share and Envy-Based Guarantees
by: Akrami, Hannaneh, et al.
Published: (2026)
by: Akrami, Hannaneh, et al.
Published: (2026)
Beating the Logarithmic Barrier for the Subadditive Maximin Share Problem
by: Seddighin, Masoud, et al.
Published: (2025)
by: Seddighin, Masoud, et al.
Published: (2025)
Maximin Share Guarantees for Few Agents with Subadditive Valuations
by: Christodoulou, George, et al.
Published: (2025)
by: Christodoulou, George, et al.
Published: (2025)
On The Pursuit of EFX for Chores: Non-Existence and Approximations
by: Christoforidis, Vasilis, et al.
Published: (2024)
by: Christoforidis, Vasilis, et al.
Published: (2024)
Approximately EFX and PO Allocations for Bivalued Chores
by: Lin, Zehan, et al.
Published: (2025)
by: Lin, Zehan, et al.
Published: (2025)
EF1 for Mixed Manna with Unequal Entitlements
by: Garg, Jugal, et al.
Published: (2024)
by: Garg, Jugal, et al.
Published: (2024)
Similar Items
-
A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023) -
Improving Approximation Guarantees for Maximin Share
by: Akrami, Hannaneh, et al.
Published: (2023) -
Constant Weighted Maximin Share Approximations for Chores
by: Li, Bo, et al.
Published: (2025) -
Bin Packing and Covering: Pushing the Frontier on the Maximin Share Fairness
by: Li, Bo, et al.
Published: (2025) -
Perpetual Fully-Online Approximate Fairness
by: Kahana, Ido, et al.
Published: (2026)