Coordination mechanisms for scheduling games with machine modification
From MaRDI portal
Publication:6070126
DOI10.1111/itor.12875OpenAlexW3088732456MaRDI QIDQ6070126
Publication date: 20 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12875
Related Items (1)
Cites Work
- Reducing price of anarchy of selfish task allocation with more selfishness
- Coordination mechanisms with hybrid local policies
- Worst-case equilibria
- Non-clairvoyant scheduling games
- Coordination mechanisms
- Inefficiency of equilibria for scheduling game with machine activation costs
- Coordination mechanisms for selfish scheduling
- On the price of anarchy of two-stage machine scheduling games
- Tighter price of anarchy for selfish task allocation on selfish machines
- Efficient coordination mechanisms for unrelated machine scheduling
- Coordination mechanism for selfish scheduling under a grade of service provision
- Efficiency analysis of load balancing games with and without activation costs
- Preemptive Coordination Mechanisms for Unrelated Machines
- The Price of Stability for Network Design with Fair Cost Allocation
- Optimal Coordination Mechanisms for Unrelated Machine Scheduling
- Conflicting Congestion Effects in Resource Allocation Games
- Load rebalancing games in dynamic systems with migration costs
- Bi‐criteria formulation for green scheduling with unrelated parallel machines with sequence‐dependent setup times
- Mixed coordination mechanisms for scheduling games on hierarchical machines
- Algorithms for a two‐machine flowshop problem with jobs of two classes
- Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods
This page was built for publication: Coordination mechanisms for scheduling games with machine modification
