A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
Fuente:
arXiv
Saved in:
| Main Authors: | Li, Bo, Sun, Ankang, Xing, Shiji |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency
by: Sun, Ankang, et al.
Published: (2024)
by: Sun, Ankang, et al.
Published: (2024)
Matching Markets with Chores
by: Garg, Jugal, et al.
Published: (2024)
by: Garg, Jugal, et al.
Published: (2024)
The Complexity of Extending Fair Allocations of Indivisible Goods
by: Deligkas, Argyrios, et al.
Published: (2025)
by: Deligkas, Argyrios, et al.
Published: (2025)
Existence of Fair and Efficient Allocation of Indivisible Chores
by: Mahara, Ryoga
Published: (2025)
by: Mahara, Ryoga
Published: (2025)
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
by: Bredereck, Robert, et al.
Published: (2020)
by: Bredereck, Robert, et al.
Published: (2020)
Constant Weighted Maximin Share Approximations for Chores
by: Li, Bo, et al.
Published: (2025)
by: Li, Bo, et al.
Published: (2025)
A Unified Framework for Weighted Hypergraphic Networks and Fractional Matching
by: Castera, Rémi, et al.
Published: (2026)
by: Castera, Rémi, et al.
Published: (2026)
Matroid Bayesian Online Selection
by: DeHaan, Ian, et al.
Published: (2024)
by: DeHaan, Ian, et al.
Published: (2024)
Bribery Can Get Harder in Structured Multiwinner Approval Election
by: Kusek, Bartosz, et al.
Published: (2022)
by: Kusek, Bartosz, et al.
Published: (2022)
Fair Interval Scheduling of Indivisible Chores
by: Equbal, Sarfaraz, et al.
Published: (2024)
by: Equbal, Sarfaraz, et al.
Published: (2024)
Fair allocations with subadditive and XOS valuations
by: Feige, Uriel, et al.
Published: (2025)
by: Feige, Uriel, et al.
Published: (2025)
Fair Division with Indivisible Goods, Chores, and Cake
by: Aziz, Haris, et al.
Published: (2025)
by: Aziz, Haris, et al.
Published: (2025)
Fair Assignment of Indivisible Chores to Asymmetric Agents
by: Seddighin, Masoud, et al.
Published: (2025)
by: Seddighin, Masoud, et al.
Published: (2025)
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)
Optimal Portfolio Compression for Priority-Proportional Clearing with Defaulting Costs
by: Csáji, Gergely, et al.
Published: (2026)
by: Csáji, Gergely, et al.
Published: (2026)
Fair Division Among Couples and Small Groups
by: Gölz, Paul, et al.
Published: (2025)
by: Gölz, Paul, et al.
Published: (2025)
The Complexity of Graph Exploration Games
by: Fuchs, Janosch, et al.
Published: (2023)
by: Fuchs, Janosch, et al.
Published: (2023)
The (Exact) Price of Cardinality for Indivisible Goods: A Parametric Perspective
by: Lam, Alexander, et al.
Published: (2025)
by: Lam, Alexander, et al.
Published: (2025)
On Robust Popular Matchings with Tie-Bounded Preferences and Stable Matchings with Two-Sided Ties
by: De, Koustav
Published: (2025)
by: De, Koustav
Published: (2025)
Robustness of Approval-Based Multiwinner Voting Rules
by: Faliszewski, Piotr, et al.
Published: (2026)
by: Faliszewski, Piotr, et al.
Published: (2026)
Selling Privacy in Blockchain Transactions
by: Chionas, Georgios, et al.
Published: (2025)
by: Chionas, Georgios, et al.
Published: (2025)
Fair distribution of bundles
by: Soberón, Pablo
Published: (2025)
by: Soberón, Pablo
Published: (2025)
Guaranteeing MMS for All but One Agent When Allocating Indivisible Chores
by: Qiu, Jiawei, et al.
Published: (2024)
by: Qiu, Jiawei, et al.
Published: (2024)
A Counterexample to EFX $n \ge 3$ Agents, $m \ge n + 5$ Items, Submodular Valuations via SAT-Solving
by: Akrami, Hannaneh, et al.
Published: (2026)
by: Akrami, Hannaneh, et al.
Published: (2026)
On the Subsidy of Envy-Free Orientations in Graphs
by: Li, Bo, et al.
Published: (2025)
by: Li, Bo, et al.
Published: (2025)
Improved Mechanisms and Prophet Inequalities for Graphical Dependencies
by: Livanos, Vasilis, et al.
Published: (2024)
by: Livanos, Vasilis, et al.
Published: (2024)
On MMS, APS and XOS
by: Feige, Uriel, et al.
Published: (2026)
by: Feige, Uriel, et al.
Published: (2026)
Allocating Mixed Goods with Customized Fairness and Indivisibility Ratio
by: Li, Bo, et al.
Published: (2024)
by: Li, Bo, et al.
Published: (2024)
A Fair and Optimal Approach to Sequential Healthcare Rationing
by: Sun, Zhaohong
Published: (2025)
by: Sun, Zhaohong
Published: (2025)
Multidimensional Budget-Feasible Mechanism Design
by: Neogi, Rian, et al.
Published: (2025)
by: Neogi, Rian, et al.
Published: (2025)
Near-Optimal Consistency-Robustness Trade-Offs for Learning-Augmented Online Knapsack Problems
by: Daneshvaramoli, Mohammadreza, et al.
Published: (2024)
by: Daneshvaramoli, Mohammadreza, et al.
Published: (2024)
Lower Bound for Online MMS Assignment of Indivisible Chores
by: Seddighin, Masoud, et al.
Published: (2025)
by: Seddighin, Masoud, et al.
Published: (2025)
The Degree of Fairness in Efficient House Allocation
by: Hosseini, Hadi, et al.
Published: (2024)
by: Hosseini, Hadi, 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)
Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings
by: V., Vishwa Prakash H., et al.
Published: (2023)
by: V., Vishwa Prakash H., et al.
Published: (2023)
On the Fairness of Normalized p-Means for Allocating Goods and Chores
by: Eckart, Owen, et al.
Published: (2024)
by: Eckart, Owen, et al.
Published: (2024)
Fair and Efficient Balanced Allocation for Indivisible Goods
by: Kawase, Yasushi, et al.
Published: (2026)
by: Kawase, Yasushi, et al.
Published: (2026)
New Fairness Concepts for Allocating Indivisible Items
by: Caragiannis, Ioannis, et al.
Published: (2022)
by: Caragiannis, Ioannis, et al.
Published: (2022)
Fair and Efficient Allocation of Indivisible Mixed Manna
by: Barman, Siddharth, et al.
Published: (2025)
by: Barman, Siddharth, et al.
Published: (2025)
Fair Orientations: Proportionality and Equitability
by: Sun, Ankang, et al.
Published: (2026)
by: Sun, Ankang, et al.
Published: (2026)
Similar Items
-
Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency
by: Sun, Ankang, et al.
Published: (2024) -
Matching Markets with Chores
by: Garg, Jugal, et al.
Published: (2024) -
The Complexity of Extending Fair Allocations of Indivisible Goods
by: Deligkas, Argyrios, et al.
Published: (2025) -
Existence of Fair and Efficient Allocation of Indivisible Chores
by: Mahara, Ryoga
Published: (2025) -
High-Multiplicity Fair Allocation Using Parametric Integer Linear Programming
by: Bredereck, Robert, et al.
Published: (2020)