Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
From MaRDI portal
Publication:3608844
Recommendations
- Randomized truthful algorithms for scheduling selfish tasks on parallel machines
- Randomized truthful algorithms for scheduling selfish tasks on parallel machines
- On truthfulness and approximation for scheduling selfish tasks
- Truthful algorithms for scheduling selfish tasks on parallel machines
- Truthfulness for the sum of weighted completion times
Cited in
(14)- Scheduling without payments
- Coordination mechanisms
- Randomized truthful algorithms for scheduling selfish tasks on parallel machines
- Tighter price of anarchy for selfish task allocation on selfish machines
- Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks in Competitive Real-Time Environments
- The anarchy of scheduling without money
- Randomized truthful algorithms for scheduling selfish tasks on parallel machines
- On truthfulness and approximation for scheduling selfish tasks
- Coordination mechanisms for selfish scheduling
- Incentive compatible mechanisms for scheduling two-parameter job agents on parallel identical machines to minimize the weighted number of late jobs
- Truthfulness for the sum of weighted completion times
- The anarchy of scheduling without money
- Truthful algorithms for scheduling selfish tasks on parallel machines
- Mechanisms with monitoring for truthful RAM allocation
This page was built for publication: Scheduling Selfish Tasks: About the Performance of Truthful Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608844)