Efficiency and inefficiency of Nash equilibrium for scheduling games on batching-machines with activation cost

DOI10.1016/j.tcs.2023.113730OpenAlexW4318973256MaRDI QIDQ2686108

Long Zhang, Min Guo, Jiguo Yu, Dong-lei Du, Yu-Zhong Zhang

Publication date: 24 February 2023

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2023.113730

zbMATH Keywords

Nash equilibriumprice of anarchyprice of stabilityapproximate Nash equilibriummixed strategy Nash equilibriumbatching-scheduling game

Mathematics Subject Classification ID

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

Cites Work

• Cost-sharing scheduling games on restricted unrelated machines
• Inefficiency of equilibria for scheduling game with machine activation costs
• Coordination mechanisms for parallel machine scheduling
• Equilibrium inefficiency in resource buying games with load-dependent costs
• The efficiency of Nash equilibria in the load balancing game with a randomizing scheduler
• Approximate Nash equilibria in anonymous games
• Scheduling games on uniform machines with activation cost
• The shortest first coordination mechanism for a scheduling game with parallel-batching machines
• Efficiency analysis of load balancing games with and without activation costs
• Non-cooperative games
• Optimal Coordination Mechanisms for Unrelated Machine Scheduling
• Conflicting Congestion Effects in Resource Allocation Games
• A Coordination Mechanism for a Scheduling Game with Uniform-Batching Machines
• Pareto-optimal Algorithms for Scheduling Games on Parallel-batching Machines with Activation Cost
• Algorithms, games, and the internet
• Efficient Computation of Approximate Pure Nash Equilibria in Congestion Games
• Selfish Routing in Capacitated Networks
• On the Existence of Pure Nash Equilibria in Weighted Congestion Games
• Unnamed Item
• Unnamed Item