Imagen de Portada

Equitable Allocations of Mixtures of Goods and Chores

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Hosseini, Hadi, Sethia, Aditi
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

The Landscape of Almost Equitable Allocations
por: Hosseini, Hadi, et al.
Publicado: (2025)

Fair Societies: Algorithms for House Allocations
por: Hosseini, Hadi, et al.
Publicado: (2025)

Best of Both Worlds Guarantees for Equitable Allocations
por: Bhaskar, Umang, et al.
Publicado: (2025)

Envy-Free and Efficient Allocations for Graphical Valuations
por: Misra, Neeldhara, et al.
Publicado: (2024)

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

The Cost and Complexity of Minimizing Envy in House Allocation
por: Madathil, Jayakrishnan, et al.
Publicado: (2024)

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

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

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

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

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

Online MMS Allocation for Chores
por: Song, Jiaxin, et al.
Publicado: (2025)

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

Exact Maximin Share Fairness via Adjusted Supply
por: Barman, Siddharth, et al.
Publicado: (2025)

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

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

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

Existence of Fair and Efficient Allocation of Indivisible Chores
por: Mahara, Ryoga
Publicado: (2025)

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

Asymptotic Fair Division: Chores Are Easier Than Goods
por: Manurangsi, Pasin, et al.
Publicado: (2025)

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

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

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

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

Epistemic vs. Counterfactual Fairness in Allocation of Resources
por: Hosseini, Hadi, et al.
Publicado: (2022)

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

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

Tâtonnement Dynamics for Fisher Markets with Chores
por: Chaudhury, Bhaskar Ray, et al.
Publicado: (2025)

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

A Note on EFX Inapproximability for Chores
por: Christoforidis, Vasilis
Publicado: (2026)

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

Centralized Group Equitability and Individual Envy-Freeness in the Allocation of Indivisible Items
por: Wang, Ying, et al.
Publicado: (2025)

The Algorithmic Landscape of Fair and Efficient Distribution of Delivery Orders in the Gig Economy
por: Hosseini, Hadi, et al.
Publicado: (2025)

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

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

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

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

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

Fair Distribution of Delivery Orders
por: Hosseini, Hadi, et al.
Publicado: (2023)

Asymptotically Fair and Truthful Allocation of Public Goods
por: Kananian, Pouya, et al.
Publicado: (2024)