Inefficiency of equilibria for the machine covering game on uniform machines
type: Item
instance of: scholarly article
title: Inefficiency of equilibria for the machine covering game on uniform machines
zbMATH Open document ID: 1285.68023
author: Zhiyi Tan
author: Long Wan
author: Qi Zhang
author: Wei Ren
published in: Acta Informatica
publication date: 2012-10-15T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 91A80
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6093698
MaRDI profile type: Publication
full work available at URL: s00236-012-0163-1
OpenAlex ID: W2057588755
cites work: Strong price of anarchy
cites work: The Price of Stability for Network Design with Fair Cost Allocation
cites work: The Santa Claus problem
cites work: Q4828962
cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
cites work: Tight bounds for bandwidth allocation on two links
cites work: Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy
cites work: Maximizing the minimum load: the cost of selfishness
cites work: Max-min Online Allocations with a Reordering Buffer
cites work: The price of anarchy on uniformly related machines revisited
cites work: Convergence time to Nash equilibrium in load balancing
cites work: Q4449200
cites work: Strong Price of Anarchy for Machine Load Balancing
cites work: A linear time approximation algorithm for multiprocessor scheduling
cites work: Worst-case equilibria
cites work: Performance guarantees of local search for multiprocessor scheduling
DOI: 10.1007/S00236-012-0163-1
description: scientific article; zbMATH DE number 6093698