Efficiency analysis with respect to the unit cost objectives in scheduling games

DOI10.1016/J.MATHSOCSCI.2018.04.003zbMath1395.91013OpenAlexW2800920387WikidataQ129903209 ScholiaQ129903209MaRDI QIDQ1645201

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

zbMATH Keywords

scheduling gamesactivation costsload-balancing gamesunit cost objectives

Mathematics Subject Classification ID

Noncooperative games (91A10) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
• Worst-case equilibria
• Utilitarian resource assignment
• Inefficiency of equilibria for scheduling game with machine activation costs
• Efficiency analysis of load balancing games with and without activation costs
• Tight bounds for worst-case equilibria
• The Price of Stability for Network Design with Fair Cost Allocation
• Conflicting Congestion Effects in Resource Allocation Games
• Algorithms, games, and the internet
• Selfish Routing in Capacitated Networks

This page was built for publication: Efficiency analysis with respect to the unit cost objectives in scheduling games