The price of envy-freeness in machine scheduling

DOI10.1016/J.TCS.2015.10.046MaRDI QIDQ899310zbMATH OpenOpenAlexFDO

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

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

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

Recommendations

• The price of envy-freeness in machine scheduling
• Fair by design: multidimensional envy-free mechanisms
• Envy-free makespan approximation
• Lower bound for envy-free and truthful makespan approximation on related machines
• On Multi-dimensional Envy-Free Mechanisms

Cites work

• scientific article; zbMATH DE number 1015852 (Why is no real title available?)
• A Polynomial Approximation Scheme for Scheduling on Uniform Processors: Using the Dual Approximation Approach
• A lower bound for scheduling mechanisms
• A lower bound of \(1+\varphi \) for truthful scheduling mechanisms
• Algorithmic mechanism design
• An Envy-Free Cake Division Protocol
• Approximation algorithms for scheduling unrelated parallel machines
• Bounds for Certain Multiprocessing Anomalies
• Dividing connected chores fairly
• Envy-free makespan approximation
• How to Cut A Cake Fairly
• On profit-maximizing envy-free pricing
• On the interval containing at least one prime number
• Optimal Auction Design
• The Price of Stability for Network Design with Fair Cost Allocation
• The efficiency of fair division
• The price of envy-freeness in machine scheduling

Cited in

(7)

• The Price of Anarchy for Minsum Related Machine Scheduling
• The price of fairness for indivisible goods
• Kalai-Smorodinsky price of fairness in two-agent single-machine scheduling problem to minimize the number of tardy jobs and maximum cost function
• Envy-free makespan approximation
• The price of envy-freeness in machine scheduling
• Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
• On Multi-dimensional Envy-Free Mechanisms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q899310)