The price of envy-freeness in machine scheduling

DOI10.1016/j.tcs.2015.10.046zbMath1337.90022OpenAlexW2287292457MaRDI QIDQ899310

Luca Moscardelli, Vittorio Bilò, Gianpiero Monaco, Angelo Fanelli, Michele Flammini

Publication date: 28 December 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.046

zbMATH Keywords

machine schedulingenvy-freeness

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Fairly allocating contiguous blocks of indivisible items ⋮ The price of fairness for indivisible goods

Cites Work

• Unnamed Item
• Unnamed Item
• Dividing connected chores fairly
• The efficiency of fair division
• Approximation algorithms for scheduling unrelated parallel machines
• A lower bound for scheduling mechanisms
• A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
• Envy-Free Makespan Approximation
• The Price of Envy-Freeness in Machine Scheduling
• The Price of Stability for Network Design with Fair Cost Allocation
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• How to Cut A Cake Fairly
• Optimal Auction Design
• An Envy-Free Cake Division Protocol
• Bounds for Certain Multiprocessing Anomalies
• On the interval containing at least one prime number
• Algorithmic mechanism design

This page was built for publication: The price of envy-freeness in machine scheduling