Reducing price of anarchy of selfish task allocation with more selfishness
From MaRDI portal
Publication:393039
DOI10.1016/j.tcs.2013.02.019zbMath1302.91043OpenAlexW2099007327MaRDI QIDQ393039
Changjun Wang, Weidong Ma, Xu-jin Chen, Xiao-Dong Hu
Publication date: 16 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2013.02.019
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 (2)
Coordination mechanisms for scheduling games with machine modification ⋮ Tighter price of anarchy for selfish task allocation on selfish machines
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tight bounds for selfish and greedy load balancing
- Coordination mechanisms
- Truthful algorithms for scheduling selfish tasks on parallel machines
- The price of selfish routing
- Coordination mechanisms for selfish scheduling
- Maximizing the minimum load for selfish agents
- On truthfulness and approximation for scheduling selfish tasks
- The exact LPT-bound for maximizing the minimum completion time
- A polynomial-time approximation scheme for maximizing the minimum machine completion time
- Approximate equilibria and ball fusion
- Truthful approximation mechanisms for scheduling selfish related machines
- Performance Guarantees of Local Search for Multiprocessor Scheduling
- Tight bounds for worst-case equilibria
- A linear time approximation algorithm for multiprocessor scheduling
- Selfish Traffic Allocation for Server Farms
- Truthful Approximation Schemes for Single-Parameter Agents
- Distributed Selfish Load Balancing
- Convergence time to Nash equilibrium in load balancing
- Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
- Load balancing without regret in the bulletin board model
- Multiplicative updates outperform generic no-regret learning in congestion games
- Tight bounds for parallel randomized load balancing
- Bounds for Certain Multiprocessing Anomalies
- Bounds on Multiprocessing Timing Anomalies
- Computing Nash equilibria for scheduling on restricted parallel links
- Algorithmic mechanism design
This page was built for publication: Reducing price of anarchy of selfish task allocation with more selfishness
