The price of envy-freeness in machine scheduling

DOI10.1016/J.TCS.2015.10.046zbMATH Open1337.90022OpenAlexW2287292457MaRDI QIDQ899310FDOQ899310

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

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

zbMATH Keywords

machine schedulingenvy-freeness

Mathematics Subject Classification ID

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

Cites Work

• On profit-maximizing envy-free pricing
• 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
• Bounds for Certain Multiprocessing Anomalies
• Approximation algorithms for scheduling unrelated parallel machines
• Optimal Auction Design
• Algorithmic mechanism design
• Title not available (Why is that?)
• How to Cut A Cake Fairly
• On the interval containing at least one prime number
• An Envy-Free Cake Division Protocol
• The efficiency of fair division
• Dividing connected chores fairly
• 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

Cited In (7)

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

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)