scientific article
From MaRDI portal
Publication:2934711
zbMath1302.90077MaRDI QIDQ2934711
Elias Koutsoupias, George Christodoulou, Angelina Vidali
Publication date: 18 December 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Deterministic scheduling theory in operations research (90B35) Auctions, bargaining, bidding and selling, and other market models (91B26) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (12)
Truthful mechanism design for multidimensional scheduling via cycle monotonicity ⋮ On designing truthful mechanisms for online scheduling ⋮ Decentralized job scheduling in the cloud based on a spatially generalized \textit{Prisoner's Dilemma} game ⋮ Improved lower bounds for non-utilitarian truthfulness ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Optimal collusion-resistant mechanisms with verification ⋮ Improved Lower Bounds for Non-utilitarian Truthfulness ⋮ A new lower bound for deterministic truthful scheduling ⋮ Collusion-Resistant Mechanisms with Verification Yielding Optimal Solutions ⋮ 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
This page was built for publication:
