On the price of anarchy of two-stage machine scheduling games
type: Item
instance of: scholarly article
title: On the price of anarchy of two-stage machine scheduling games
zbMATH Open document ID: 1481.90192
author: Deshi Ye
author: Lin Chen
author: Guochuan Zhang
published in: Journal of Combinatorial Optimization
publication date: 2021-11-25T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91A80
zbMATH DE Number: 7433405
zbMATH Keywords: price of anarchy
zbMATH Keywords: scheduling
zbMATH Keywords: coordination mechanisms
MaRDI profile type: Publication
full work available at URL: s10878-019-00474-2
OpenAlex ID: W2983111355
Wikidata QID: Q126842980
cites work: Q3579396
cites work: Q4633894
cites work: Maximizing the minimum load: the cost of selfishness
cites work: Efficiency of Dual Equilibria in Selfish Task Allocation to Selfish Machines
cites work: Automata, Languages and Programming
cites work: Non-clairvoyant scheduling games
cites work: Inner product spaces for MinSum coordination mechanisms
cites work: Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
cites work: Scheduling Independent Tasks on Uniform Processors
cites work: Inefficiency of Nash Equilibria
cites work: The cost of selfishness for maximizing the minimum load on uniformly related machines
cites work: The price of anarchy on uniformly related machines revisited
cites work: On a network creation game
cites work: The price of anarchy in large games
cites work: A linear time approximation algorithm for multiprocessor scheduling
cites work: Tighter Bounds for LPT Scheduling on Uniform Processors
cites work: Bounds for Certain Multiprocessing Anomalies
cites work: Bounds on Multiprocessing Timing Anomalies
cites work: The Price of Anarchy for Minsum Related Machine Scheduling
cites work: Coordination mechanisms for selfish scheduling
cites work: Q3409969
cites work: Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
cites work: Q5417647
cites work: Algorithmic Game Theory
cites work: Bounding the inefficiency of equilibria in nonatomic congestion games
cites work: How bad is selfish routing?
cites work: Inefficiency of equilibria for the machine covering game on uniform machines
DOI: 10.1007/S10878-019-00474-2
description: scientific article; zbMATH DE number 7433405