Efficient coordination mechanisms for unrelated machine scheduling
From MaRDI portal
Publication:4633894
Recommendations
Cited in
(27)- Scheduling tasks from selfish multi-tasks agents
- Non-clairvoyant scheduling games
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs
- Designing cost-sharing methods for Bayesian games
- Primary versus secondary infrastructure capacity allocation mechanisms
- Cooperation in one machine scheduling
- Coordination mechanisms
- Optimal coordination mechanisms for unrelated machine scheduling
- Coordination mechanisms for scheduling selfish jobs with favorite machines
- Non-preemptive Coordination Mechanisms for Identical Machine Scheduling Games
- Coordinating oligopolistic players in unrelated machine scheduling
- Non-clairvoyant scheduling games
- Nonpreemptive coordination mechanisms for identical machines
- Competitive routing over time
- Efficient coordination mechanisms for unrelated machine scheduling
- Coordination mechanism for selfish scheduling under a grade of service provision
- Coordination mechanisms from (almost) all scheduling policies
- Coordination mechanisms, cost-sharing, and approximation algorithms for scheduling
- Coordination mechanisms for parallel machine scheduling
- Coordination mechanisms with hybrid local policies
- Inner product spaces for minsum coordination mechanisms
- Coordination mechanisms for selfish parallel jobs scheduling (extended abstract)
- On the price of anarchy of two-stage machine scheduling games
- Unrelated parallel machine scheduling -- perspectives and progress
- Preemptive coordination mechanisms for unrelated machines
- Optimal cost sharing for capacitated facility location games
- Bounds for the convergence time of local search in scheduling problems
This page was built for publication: Efficient coordination mechanisms for unrelated machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633894)
