Copula-based randomized mechanisms for truthful scheduling on two unrelated machines

DOI10.1007/S00224-014-9601-5zbMath1327.91023OpenAlexW2096141465MaRDI QIDQ904694

Luis F. Zuluaga, Dong-lei Du, Xu-jin Chen

Publication date: 13 January 2016

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-014-9601-5

zbMATH Keywords

copulaalgorithmic mechanism designrandom mechanismtruthful scheduling

Mathematics Subject Classification ID

Characterization and structure theory for multivariate probability distributions; copulas (62H05) Applications of game theory (91A80) Deterministic scheduling theory in operations research (90B35) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (4)

Setting lower bounds on truthfulness ⋮ A proof of the Nisan-Ronen conjecture ⋮ A new lower bound for deterministic truthful scheduling ⋮ New bounds for truthful scheduling on two unrelated selfish machines

Cites Work

• Unnamed Item
• Optimal Lower Bounds for Anonymous Scheduling Mechanisms
• Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization
• A Lower Bound of 1 + φ for Truthful Scheduling Mechanisms
• A Characterization of 2-Player Mechanisms for Scheduling
• A model for association in bivariate life tables and its application in epidemiological studies of familial tendency in chronic disease incidence
• Algorithmic mechanism design

This page was built for publication: Copula-based randomized mechanisms for truthful scheduling on two unrelated machines