Tighter price of anarchy for selfish task allocation on selfish machines
From MaRDI portal
Publication:2082200
DOI10.1007/s10878-020-00556-6zbMath1502.90071OpenAlexW3010591586MaRDI QIDQ2082200
Xiayan Cheng, Rongheng Li, Yunxia Zhou
Publication date: 4 October 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00556-6
Analysis of algorithms and problem complexity (68Q25) Noncooperative games (91A10) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Inefficiency of Nash equilibrium for scheduling games with constrained jobs: a parametric analysis
- Reducing price of anarchy of selfish task allocation with more selfishness
- About one algorithm for solving scheduling problem
- Inefficiency analysis of the scheduling game on limited identical machines with activation costs
- Preemptive parallel-machine scheduling problem of maximizing the number of on-time jobs
- Efficiency analysis of load balancing games with and without activation costs
- Truthful approximation mechanisms for scheduling selfish related machines
- A linear time approximation algorithm for multiprocessor scheduling
- Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
- Online scheduling for jobs with nondecreasing release times and similar lengths on parallel machines
- Bounds on Multiprocessing Timing Anomalies
- Algorithmic mechanism design
This page was built for publication: Tighter price of anarchy for selfish task allocation on selfish machines
