Publication:2934711
From MaRDI portal
zbMath1302.90077MaRDI QIDQ2934711
Elias Koutsoupias, George Christodoulou, Angelina Vidali
Publication date: 18 December 2014
90B35: Deterministic scheduling theory in operations research
91B26: Auctions, bargaining, bidding and selling, and other market models
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Improved Lower Bounds for Non-utilitarian Truthfulness, A new lower bound for deterministic truthful scheduling, Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions, Decentralized job scheduling in the cloud based on a spatially generalized \textit{Prisoner's Dilemma} game, Unrelated parallel machine scheduling -- perspectives and progress, Improved lower bounds for non-utilitarian truthfulness, Truthful mechanism design for multidimensional scheduling via cycle monotonicity, On designing truthful mechanisms for online scheduling, Truthful mechanisms for two-range-values variant of unrelated scheduling, Fair cost-sharing methods for scheduling jobs on parallel machines, A lower bound for scheduling mechanisms, Optimal collusion-resistant mechanisms with verification