Randomized mechanism design for decentralized network scheduling

DOI10.1080/10556788.2020.1713129MaRDI QIDQ5135252zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 19 November 2020

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2020.1713129

zbMATH Keywords

asymptotic optimalitydecentralized mechanism designgraph approachmyopic Bayes-Nash incentive compatibilitynetwork scheduling

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Deterministic network models in operations research (90B10) Stochastic scheduling theory in operations research (90B36)

Recommendations

• Decentralization and Mechanism Design for Online Machine Scheduling
• Mechanism design for decentralized online machine scheduling
• Efficient mechanism design for online scheduling
• Recent developments in the mechanism design problem for scheduling
• Decentralized utilitarian mechanisms for scheduling games

Cites work

• A Smart Market for Industrial Procurement with Capacity Constraints
• A supermodular relaxation for scheduling with release dates
• An inverse-optimization-based auction mechanism to support a multiattribute RFQ process
• An optimal auction for capacity constrained bidders: a network perspective
• Approximation in stochastic scheduling
• Auction protocols for decentralized scheduling
• Computationally feasible VCG mechanisms
• Distributionally robust workforce scheduling in call centres with uncertain arrival rates
• scientific article; zbMATH DE number 2135144 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• LP-based online scheduling: From single to parallel machines
• Mechanism design for decentralized online machine scheduling
• Mechanism design in queueing problems
• Models and Algorithms for Stochastic Online Scheduling
• On optimal mechanism design for a sequencing problem
• On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
• Online scheduling of two uniform machines to minimize total completion times
• Probabilistic Analysis of a Machine Scheduling Problem
• Scheduling of a single machine to minimize total weighted completion time subject to release dates
• Scheduling to minimize total weighted completion time: performance guarantees of LP-based heuristics and lower bounds
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
• Weak monotonicity and Bayes-Nash incentive compatibility

Cited in

(5)

• Decentralized utilitarian mechanisms for scheduling games
• scientific article; zbMATH DE number 2088585 (Why is no real title available?)
• Mechanism design for decentralized online machine scheduling
• Incentive compatible, collaborative production scheduling with simple communication among distributed agents
• Decentralization and Mechanism Design for Online Machine Scheduling

This page was built for publication: Randomized mechanism design for decentralized network scheduling

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