Approximate strong equilibria in job scheduling games with two uniformly related machines

Discrete Applied Mathematics ◽

10.1016/j.dam.2013.02.035 ◽

2013 ◽

Vol 161 (13-14) ◽

pp. 1843-1858 ◽

Author(s):

Leah Epstein ◽

Michal Feldman ◽

Tami Tamir ◽

Łukasz Witkowski ◽

Marcin Witkowski

Keyword(s):

Job Scheduling ◽

Uniformly Related Machines ◽

Strong Equilibria ◽

Related Machines ◽

Scheduling Games

Download Full-text

The price of anarchy for utilitarian scheduling games on related machines

Discrete Optimization ◽

10.1016/j.disopt.2018.08.001 ◽

2019 ◽

Vol 31 ◽

pp. 29-39 ◽

Author(s):

Ruben Hoeksma ◽

Marc Uetz

Keyword(s):

Price Of Anarchy ◽

Related Machines ◽

Scheduling Games

Download Full-text

The price of anarchy on uniformly related machines revisited

Information and Computation ◽

10.1016/j.ic.2012.01.005 ◽

2012 ◽

Vol 212 ◽

pp. 37-54 ◽

Author(s):

Leah Epstein ◽

Rob van Stee

Keyword(s):

Price Of Anarchy ◽

Uniformly Related Machines ◽

Related Machines

Download Full-text

Online Scheduling of Uniformly Related Machines in the List Mode

International Journal of Simulation Systems Science & Technology ◽

10.5013/ijssst.a.17.49.60 ◽

2016 ◽

Author(s):

Guest Editor Jianping Du

Keyword(s):

Online Scheduling ◽

List Mode ◽

Uniformly Related Machines ◽

Related Machines

Download Full-text

Optimal and Online Preemptive Scheduling on Uniformly Related Machines

Lecture Notes in Computer Science - STACS 2004 ◽

10.1007/978-3-540-24749-4_18 ◽

2004 ◽

pp. 199-210 ◽

Author(s):

Tomáš Ebenlendr ◽

Jiří Sgall

Keyword(s):

Preemptive Scheduling ◽

Uniformly Related Machines ◽

Related Machines

Download Full-text

The Price of Anarchy on Uniformly Related Machines Revisited

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79309-0_6 ◽

2008 ◽

pp. 46-57 ◽

Author(s):

Leah Epstein ◽

Rob van Stee

Keyword(s):

Price Of Anarchy ◽

Uniformly Related Machines ◽

Related Machines

Download Full-text

Optimal Coordination Mechanisms for Multi-job Scheduling Games

Algorithms - ESA 2014 - Lecture Notes in Computer Science ◽

10.1007/978-3-662-44777-2_2 ◽

2014 ◽

pp. 13-24 ◽

Author(s):

Fidaa Abed ◽

José R. Correa ◽

Chien-Chung Huang

Keyword(s):

Job Scheduling ◽

Coordination Mechanisms ◽

Optimal Coordination ◽

Scheduling Games

Download Full-text

A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines

Automata, Languages and Programming - Lecture Notes in Computer Science ◽

10.1007/3-540-48224-5_69 ◽

2001 ◽

pp. 848-861 ◽

Author(s):

Chandra Chekuri ◽

Sanjeev Khanna

Keyword(s):

Completion Time ◽

Uniformly Related Machines ◽

Weighted Completion Time ◽

Related Machines

Download Full-text

An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines

Journal of Algorithms ◽

10.1006/jagm.2001.1184 ◽

2001 ◽

Vol 41 (2) ◽

pp. 212-224 ◽

Author(s):

Chandra Chekuri ◽

Michael Bender

Keyword(s):

Approximation Algorithm ◽

Uniformly Related Machines ◽

Efficient Approximation Algorithm ◽

Related Machines ◽

Efficient Approximation

Download Full-text

Preemptive scheduling on uniformly related machines: minimizing the sum of the largest pair of job completion times

Journal of Scheduling ◽

10.1007/s10951-016-0476-y ◽

2016 ◽

Vol 20 (2) ◽

pp. 115-127

Author(s):

Leah Epstein ◽

Ido Yatsiv

Keyword(s):

Preemptive Scheduling ◽

Uniformly Related Machines ◽

Related Machines ◽

Completion Times

Download Full-text

Approximate Strong Equilibrium in Job Scheduling Games

Algorithmic Game Theory - Lecture Notes in Computer Science ◽

10.1007/978-3-540-79309-0_7 ◽

2008 ◽

pp. 58-69 ◽

Author(s):

Michal Feldman ◽

Tami Tamir

Keyword(s):

Job Scheduling ◽

Strong Equilibrium ◽

Scheduling Games

Download Full-text