We investigate the scheduling game on a fixed number m of identical machines that no machines are initially activated and each machine activated incurs the same ...
We investigate the scheduling game on a fixed number m of identical machines that no machines are initially activated and each machine activated incurs the ...
We investigate the scheduling game on a fixed number m of identical machines that no machines are initially activated and each machine activated incurs the ...
Inefficiency analysis of the scheduling game on limited identical ...
documentsdelivered.com › source
Inefficiency analysis of the scheduling game on limited identical machines with activation costs · Information Processing Letters 116(4): 316-320 · 2016 · Related ...
In this paper, we revisit the inefficiency of Nash Equilibrium of scheduling games by considering the Price of Anarchy (PoA) as a function of r, ...
This paper studies a scheduling game on uniform machines with social cost of maximizing the minimum machine load. For the game with two machines, ...
In this paper, we study the scheduling game with machine activation costs. A set of jobs is to be processed on parallel identical machines.
Missing: limited | Show results with:limited
The problem of measuring the inefficiency of equilibria on two uniform machines is completely solved, and the Price of Stability and Price of Anarchy are ...
This paper studies the inefficiency of Nash equilibria (NE) for scheduling games on hierarchical machines with quadratic social cost.
Inefficiency analysis of the scheduling game on limited identical machines with activation costs. Information Processing Letters, Vol. 116, No. 4 | 1 Apr ...