Efficiency analysis with respect to the unit cost objectives in scheduling games
From MaRDI portal
Publication:1645201
DOI10.1016/J.MATHSOCSCI.2018.04.003zbMATH Open1395.91013OpenAlexW2800920387WikidataQ129903209 ScholiaQ129903209MaRDI QIDQ1645201FDOQ1645201
Authors: Song-Song Li 
Publication date: 28 June 2018
Published in: Mathematical Social Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mathsocsci.2018.04.003
Recommendations
- Inefficiency of equilibria for scheduling game with machine activation costs
- Efficiency analysis of load balancing games with and without activation costs
- Inefficiency analysis of the scheduling game on limited identical machines with activation costs
- Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost
- Scheduling games on uniform machines with activation cost
Cites Work
- Worst-case equilibria
- Selfish Routing in Capacitated Networks
- Tight bounds for worst-case equilibria
- The Price of Stability for Network Design with Fair Cost Allocation
- Selfish load balancing
- Efficiency analysis of load balancing games with and without activation costs
- Conflicting congestion effects in resource allocation games
- Algorithms, games, and the internet
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
- Utilitarian resource assignment
- Inefficiency of equilibria for scheduling game with machine activation costs
Cited In (1)
This page was built for publication: Efficiency analysis with respect to the unit cost objectives in scheduling games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1645201)
