Imagen de Portada

When is Truthfully Allocating Chores no Harder than Goods?

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Li, Bo, Tao, Biaoshuai, Wang, Fangxiao, Wu, Xiaowei, Yang, Mingwei, Zhou, Shengwei
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

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

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

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

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

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

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

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

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

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

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

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

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

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

Approximate Envy-Free Allocations up to any $k$ Goods
por: Filos-Ratsikas, Aris, et al.
Publicado: (2026)

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

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)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Allocating Mixed Goods with Customized Fairness and Indivisibility Ratio
por: Li, Bo, et al.
Publicado: (2024)

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

It's Not All Black and White: Degree of Truthfulness for Risk-Avoiding Agents
por: Hartman, Eden, et al.
Publicado: (2025)

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

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

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

A Complete Landscape for the Price of Envy-Freeness
por: Li, Zihao, et al.
Publicado: (2024)

Likelihood of the Existence of Average Justified Representation
por: Han, Qishen, et al.
Publicado: (2025)

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