The following pages link to (Q2934711):
Displaying 12 items.
- Decentralized job scheduling in the cloud based on a spatially generalized \textit{Prisoner's Dilemma} game (Q326996) (← links)
- Unrelated parallel machine scheduling -- perspectives and progress (Q505093) (← links)
- Improved lower bounds for non-utilitarian truthfulness (Q627119) (← links)
- Truthful mechanism design for multidimensional scheduling via cycle monotonicity (Q834857) (← links)
- On designing truthful mechanisms for online scheduling (Q838147) (← links)
- Truthful mechanisms for two-range-values variant of unrelated scheduling (Q1019737) (← links)
- Fair cost-sharing methods for scheduling jobs on parallel machines (Q1026241) (← links)
- A lower bound for scheduling mechanisms (Q1031874) (← links)
- Optimal collusion-resistant mechanisms with verification (Q2016253) (← links)
- Improved Lower Bounds for Non-utilitarian Truthfulness (Q5443369) (← links)
- Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions (Q5900469) (← links)
- A new lower bound for deterministic truthful scheduling (Q5918088) (← links)
