Truthful Mechanisms for Competitive Reward-Based Scheduling

DOI10.1109/TC.2015.2479598MaRDI QIDQ2985409zbMATH OpenFDO

Authors Lena Mashayekhy, Nathan Fisher, D. Grosu

Publication date 16 May 2017

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.2015.2479598

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35)

Cited in

(5)

• Truthful mechanisms for two-range-values variant of unrelated scheduling
• Truthful mechanism design for bin packing with applications on cloud computing
• Strategy-proof mechanism for online resource allocation in cloud and edge collaboration
• Truthful Mechanisms for Allocating a Single Processor to Sporadic Tasks in Competitive Real-Time Environments
• Truthful mechanism design for multidimensional scheduling via cycle monotonicity

This page was built for publication: Truthful Mechanisms for Competitive Reward-Based Scheduling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2985409)