We consider k-envy-free assignments for scheduling problems in which the completion time of each machine is not ktimes larger than the one she could achieve by getting the jobs of another machine, for a given factor k ≥1. We introduce and investigate the notion of price of k-envy-freeness, defined as the ratio between the makespan of the best k-envy-free assignment and that of an optimal allocation achievable without envy-freeness constraints. We provide exact or asymptotically tight bounds on the price of k-envy-freeness for all the basic scheduling models, that is unrelated, related and identical machines. Moreover, we show how to efficiently compute such allocations with a worsening multiplicative factor being at most the best approximation ratio for the minimum makespan problem guaranteed by a polynomial time algorithm for each specific model. Finally, we extend our results to the case of restricted assignments and to the objective of minimizing the sum of the completion times of all the machines.

The Price of Envy-Freeness in Machine Scheduling

FLAMMINI MICHELE;
2016

Abstract

We consider k-envy-free assignments for scheduling problems in which the completion time of each machine is not ktimes larger than the one she could achieve by getting the jobs of another machine, for a given factor k ≥1. We introduce and investigate the notion of price of k-envy-freeness, defined as the ratio between the makespan of the best k-envy-free assignment and that of an optimal allocation achievable without envy-freeness constraints. We provide exact or asymptotically tight bounds on the price of k-envy-freeness for all the basic scheduling models, that is unrelated, related and identical machines. Moreover, we show how to efficiently compute such allocations with a worsening multiplicative factor being at most the best approximation ratio for the minimum makespan problem guaranteed by a polynomial time algorithm for each specific model. Finally, we extend our results to the case of restricted assignments and to the objective of minimizing the sum of the completion times of all the machines.
Envy-freeness, Machine scheduling
File in questo prodotto:
File Dimensione Formato  
PrePrint_2016_TheorComputSci_613_Bilo.pdf

accesso aperto

Tipologia: Documento in Pre-print
Licenza: Accesso gratuito
Dimensione 371.93 kB
Formato Adobe PDF
371.93 kB Adobe PDF Visualizza/Apri
2016_TheorComputSci_613_Bilo.pdf

non disponibili

Tipologia: Versione Editoriale (PDF)
Licenza: Non pubblico
Dimensione 432.23 kB
Formato Adobe PDF
432.23 kB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12571/2310
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 5
  • ???jsp.display-item.citation.isi??? 1
social impact