Fair Repetitive Interval Scheduling
Fuente:
arXiv
Saved in:
| Main Authors: | Heeger, Klaus, Hermelin, Danny, Itzhaki, Yuval, Molter, Hendrik, Shabtay, Dvir |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Fairness in Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2021)
by: Hermelin, Danny, et al.
Published: (2021)
Approximation Algorithms for Fair Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2025)
by: Hermelin, Danny, et al.
Published: (2025)
How to Make Knockout Tournaments More Popular?
by: Chaudhary, Juhi, et al.
Published: (2023)
by: Chaudhary, Juhi, et al.
Published: (2023)
Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard
by: Heeger, Klaus, et al.
Published: (2024)
by: Heeger, Klaus, et al.
Published: (2024)
Adaptive Manipulation for Coalitions in Knockout Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)
by: Chaudhary, Juhi, et al.
Published: (2024)
Fast Makespan Minimization via Short ILPs
by: Hermelin, Danny, et al.
Published: (2026)
by: Hermelin, Danny, et al.
Published: (2026)
Faster Minimization of Total Weighted Completion Time on Parallel Machines
by: Hermelin, Danny, et al.
Published: (2025)
by: Hermelin, Danny, et al.
Published: (2025)
Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
by: Segev, Danny, et al.
Published: (2020)
by: Segev, Danny, et al.
Published: (2020)
Beyond Exact Fairness: Envy-Free Incomplete Connected Fair Division
by: S, Ajaykrishnan E, et al.
Published: (2025)
by: S, Ajaykrishnan E, et al.
Published: (2025)
Conflict and Fairness in Resource Allocation
by: Bandopadhyay, Susobhan, et al.
Published: (2024)
by: Bandopadhyay, Susobhan, et al.
Published: (2024)
Fairness and Efficiency in Online Class Matching
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2024)
by: Hajiaghayi, MohammadTaghi, et al.
Published: (2024)
Non-Monotonicity in Fair Division of Graphs
by: Hosseini, Hadi, et al.
Published: (2025)
by: Hosseini, Hadi, et al.
Published: (2025)
Minimizing the Weighted Number of Tardy Jobs is W[1]-hard
by: Heeger, Klaus, et al.
Published: (2024)
by: Heeger, Klaus, et al.
Published: (2024)
Selfish, Local and Online Scheduling via Vector Fitting
by: Kashaev, Danish
Published: (2025)
by: Kashaev, Danish
Published: (2025)
A Reduction from Chores Allocation to Job Scheduling
by: Huang, Xin, et al.
Published: (2023)
by: Huang, Xin, et al.
Published: (2023)
Position Fair Mechanisms Allocating Indivisible Goods
by: Mahara, Ryoga, et al.
Published: (2024)
by: Mahara, Ryoga, et al.
Published: (2024)
Tradeoffs in Privacy, Welfare, and Fairness for Facility Location
by: Fish, Sara, et al.
Published: (2026)
by: Fish, Sara, et al.
Published: (2026)
Fairness and Efficiency in Two-Sided Matching Markets
by: Jain, Pallavi, et al.
Published: (2025)
by: Jain, Pallavi, et al.
Published: (2025)
Revisiting Fair and Efficient Allocations for Bivalued Goods
by: Liu, Hui, et al.
Published: (2026)
by: Liu, Hui, et al.
Published: (2026)
Fair Multi-agent Persuasion with Submodular Constraints
by: Bai, Yannan, et al.
Published: (2025)
by: Bai, Yannan, et al.
Published: (2025)
An Exercise in Tournament Design: When Some Matches Must Be Scheduled
by: Gupta, Sushmita, et al.
Published: (2024)
by: Gupta, Sushmita, et al.
Published: (2024)
Group Fairness and Multi-criteria Optimization in School Assignment
by: A., Santhini K., et al.
Published: (2024)
by: A., Santhini K., et al.
Published: (2024)
Fair Rent Division: New Budget and Rent Constraints
by: Gangam, Rohith Reddy, et al.
Published: (2025)
by: Gangam, Rohith Reddy, et al.
Published: (2025)
Optimally Interpolating between Ex-Ante Fairness and Welfare
by: Høgsgaard, Mikael Møller, et al.
Published: (2023)
by: Høgsgaard, Mikael Møller, et al.
Published: (2023)
Beyond the Half-Approximation: Fair and Efficient Online Class Matching
by: Borst, Sander, et al.
Published: (2026)
by: Borst, Sander, et al.
Published: (2026)
Fair Allocation with Binary Valuations for Mixed Divisible and Indivisible Goods
by: Kawase, Yasushi, et al.
Published: (2023)
by: Kawase, Yasushi, et al.
Published: (2023)
Online Allocation with Multi-Class Arrivals: Group Fairness vs Individual Welfare
by: Zargari, Faraz, et al.
Published: (2025)
by: Zargari, Faraz, et al.
Published: (2025)
Minimizing the Number of Tardy Jobs with Uniform Processing Times on Parallel Machines
by: Heeger, Klaus, et al.
Published: (2024)
by: Heeger, Klaus, et al.
Published: (2024)
Lawler-Moore Speedups via Additive Combinatorics
by: Bringmann, Karl, et al.
Published: (2026)
by: Bringmann, Karl, et al.
Published: (2026)
The Limits of Interval-Regulated Price Discrimination
by: Munagala, Kamesh, et al.
Published: (2024)
by: Munagala, Kamesh, et al.
Published: (2024)
Revenue Maximization in Choice-Based Matching Markets
by: Nissim, Dan, et al.
Published: (2024)
by: Nissim, Dan, et al.
Published: (2024)
Reducing Leximin Fairness to Utilitarian Optimization
by: Hartman, Eden, et al.
Published: (2024)
by: Hartman, Eden, et al.
Published: (2024)
Fixed Point Computation: Beating Brute Force with Smoothed Analysis
by: Attias, Idan, et al.
Published: (2025)
by: Attias, Idan, et al.
Published: (2025)
Online Fair Allocation with Best-of-Many-Worlds Guarantees
by: Yang, Zongjun, et al.
Published: (2024)
by: Yang, Zongjun, et al.
Published: (2024)
Algorithmically Fair Maximization of Multiple Submodular Objective Functions
by: Amanatidis, Georgios, et al.
Published: (2024)
by: Amanatidis, Georgios, et al.
Published: (2024)
Fair integer programming under dichotomous and cardinal preferences
by: Demeulemeester, Tom, et al.
Published: (2023)
by: Demeulemeester, Tom, et al.
Published: (2023)
Fairly Wired: Towards Leximin-Optimal Division of Electricity
by: Hartman, Eden, et al.
Published: (2025)
by: Hartman, Eden, et al.
Published: (2025)
Group Fair Matchings using Convex Cost Functions
by: Panda, Atasi, et al.
Published: (2025)
by: Panda, Atasi, et al.
Published: (2025)
Online Fair Division: Towards Ex-Post Constant MMS Guarantees
by: Kulkarni, Pooja, et al.
Published: (2025)
by: Kulkarni, Pooja, et al.
Published: (2025)
Probing EFX via PMMS: (Non-)Existence Results in Discrete Fair Division
by: Byrka, Jarosław, et al.
Published: (2025)
by: Byrka, Jarosław, et al.
Published: (2025)
Similar Items
-
Fairness in Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2021) -
Approximation Algorithms for Fair Repetitive Scheduling
by: Hermelin, Danny, et al.
Published: (2025) -
How to Make Knockout Tournaments More Popular?
by: Chaudhary, Juhi, et al.
Published: (2023) -
Minimizing the Number of Tardy Jobs and Maximal Tardiness on a Single Machine is NP-hard
by: Heeger, Klaus, et al.
Published: (2024) -
Adaptive Manipulation for Coalitions in Knockout Tournaments
by: Chaudhary, Juhi, et al.
Published: (2024)