Inefficiency of equilibria for scheduling game with machine activation costs
type: Item
instance of: scholarly article
title: Inefficiency of equilibria for scheduling game with machine activation costs
zbMATH Open document ID: 1333.91010
author: Ling Lin
author: Xiaochen Xian
author: Yujie Yan
author: Xing He
author: Zhiyi Tan
published in: Theoretical Computer Science
publication date: 2015-12-08T00:00:00Z
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 91A10
zbMATH DE Number: 6517478
zbMATH Keywords: scheduling game
zbMATH Keywords: Nash equilibrium
zbMATH Keywords: price of anarchy
zbMATH Keywords: price of stability
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.05.035
OpenAlex ID: W618543335
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: Utilitarian resource assignment
cites work: Efficiency analysis of load balancing games with and without activation costs
cites work: Tight bounds for worst-case equilibria
cites work: Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
cites work: Strong equilibrium in cost sharing connection games
cites work: The price of anarchy on uniformly related machines revisited
cites work: Q4449200
cites work: Conflicting Congestion Effects in Resource Allocation Games
cites work: The structure and complexity of Nash equilibria for a selfish routing game
cites work: Worst-case equilibria
DOI: 10.1016/J.TCS.2015.05.035
description: scientific article; zbMATH DE number 6517478