Image de couverture de livre

Fair Interval Scheduling of Indivisible Chores

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Equbal, Sarfaraz, Gurjar, Rohit, Kumar, Yatharth, Nath, Swaprava, Saxena, Raghuvansh, Vaish, Rohit
Format:	Preprint
Publié:	2024
Sujets:	Computer Science and Game Theory
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fair Allocation under Conflict Constraints
par: Equbal, Sarfaraz, et autres
Publié: (2026)

Fair and Efficient Completion of Indivisible Goods
par: HV, Vishwa Prakash, et autres
Publié: (2024)

Fair Division with Indivisible Goods, Chores, and Cake
par: Aziz, Haris, et autres
Publié: (2025)

Existence of Fair and Efficient Allocation of Indivisible Chores
par: Mahara, Ryoga
Publié: (2025)

Fair Assignment of Indivisible Chores to Asymmetric Agents
par: Seddighin, Masoud, et autres
Publié: (2025)

A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
par: Li, Bo, et autres
Publié: (2024)

Lower Bound for Online MMS Assignment of Indivisible Chores
par: Seddighin, Masoud, et autres
Publié: (2025)

Approximately Optimal Mechanism Design for Competing Sellers
par: Lucier, Brendan, et autres
Publié: (2025)

Epistemic vs. Counterfactual Fairness in Allocation of Resources
par: Hosseini, Hadi, et autres
Publié: (2022)

Temporal Fair Division of Indivisible Goods with Scheduling
par: Choi, Kui-Wang, et autres
Publié: (2026)

Guaranteeing MMS for All but One Agent When Allocating Indivisible Chores
par: Qiu, Jiawei, et autres
Publié: (2024)

Approximate EFX and Exact tEFX Allocations for Indivisible Chores: Improved Algorithms
par: Afshinmehr, Mahyar, et autres
Publié: (2024)

Connected Equitable Cake Division via Sperner's Lemma
par: Bhaskar, Umang, et autres
Publié: (2024)

Sequential Solution Concepts in Cooperative Games with Generalized Characteristic Functions
par: Goyal, Ashwin, et autres
Publié: (2025)

Likes, Budgets, and Equilibria: Designing Contests for Socially Optimal Advertising
par: Mandal, Sayantika, et autres
Publié: (2025)

Capacity Modification in the Stable Matching Problem
par: Gokhale, Salil, et autres
Publié: (2024)

Fair Division of Indivisible Items
par: Hsu, Kevin
Publié: (2025)

Trading Prophets: How to Trade Multiple Stocks Optimally
par: Rajput, Surbhi, et autres
Publié: (2025)

Weighted Proportional Allocations of Indivisible Goods and Chores: Insights via Matchings
par: V., Vishwa Prakash H., et autres
Publié: (2023)

Approximating One-Sided and Two-Sided Nash Social Welfare With Capacities
par: Gokhale, Salil, et autres
Publié: (2024)

On the Fairness of Normalized p-Means for Allocating Goods and Chores
par: Eckart, Owen, et autres
Publié: (2024)

Fair and Efficient Balanced Allocation for Indivisible Goods
par: Kawase, Yasushi, et autres
Publié: (2026)

The Complexity of Fair Division of Indivisible Items with Externalities
par: Deligkas, Argyrios, et autres
Publié: (2023)

New Fairness Concepts for Allocating Indivisible Items
par: Caragiannis, Ioannis, et autres
Publié: (2022)

Fair and Efficient Allocation of Indivisible Mixed Manna
par: Barman, Siddharth, et autres
Publié: (2025)

On the Existence of Fair Allocations for Goods and Chores under Dissimilar Preferences
par: Gagushin, Egor, et autres
Publié: (2025)

Fair Division of Chores with Budget Constraints
par: Elkind, Edith, et autres
Publié: (2024)

Allocating Mixed Goods with Customized Fairness and Indivisibility Ratio
par: Li, Bo, et autres
Publié: (2024)

Computing Welfare-Maximizing Fair Allocations of Indivisible Goods
par: Aziz, Haris, et autres
Publié: (2020)

A Gale-Shapley View of Unique Stable Marriages
par: Gokhale, Kartik, et autres
Publié: (2023)

Asymptotic Fair Division: Chores Are Easier Than Goods
par: Manurangsi, Pasin, et autres
Publié: (2025)

Fair Repetitive Interval Scheduling
par: Heeger, Klaus, et autres
Publié: (2024)

Best-of-Both-Worlds Fair Allocation of Indivisible and Mixed Goods
par: Bu, Xiaolin, et autres
Publié: (2024)

Maximin Fair Allocation of Indivisible Items under Cost Utilities
par: Botan, Sirin, et autres
Publié: (2024)

Symmetrically Fair Allocations of Indivisible Goods
par: Johnston, Connor, et autres
Publié: (2024)

Temporal Fair Division of Indivisible Items
par: Elkind, Edith, et autres
Publié: (2024)

Logarithmic Comparison-Based Query Complexity for Fair Division of Indivisible Goods
par: Bu, Xiaolin, et autres
Publié: (2024)

Bad News for Couples: Tight Lower Bounds for Fair Division of Indivisible Items
par: la Tour, Max Dupré
Publié: (2026)

Dividing Indivisible Items for the Benefit of All: It is Hard to Be Fair Without Social Awareness
par: Deligkas, Argyris, et autres
Publié: (2025)

Weighted Fairness Notions for Indivisible Items Revisited
par: Chakraborty, Mithun, et autres
Publié: (2021)