Truthful Approximation Mechanisms for Scheduling Selfish Related Machines

ISSN： 1432-4350

Source： Theory of Computing Systems, Vol.40, Iss.4, 2007-06, pp. : 423-436

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Truthful Mechanisms for Selfish Routing and Two-Parameter Agents

By Thielen Clemens

Theory of Computing Systems, Vol. 49, Iss. 1, 2011-07 ,pp. : 196-223

Springer Publishing Company

Access to resources Recommend Favorite

A Truthful Mechanism for Value-Based Scheduling in Cloud Computing

By Jain Navendu Menache Ishai Naor Joseph Yaniv Jonathan

Theory of Computing Systems, Vol. 54, Iss. 3, 2014-04 ,pp. : 388-406

Springer Publishing Company

Access to resources Recommend Favorite

Two Parallel Machines Scheduling

By Lin S-F. Chen J-Y.

Systems Analysis Modelling Simulation, Vol. 42, Iss. 10, 2002-01 ,pp. : 1429-1437

Taylor & Francis Ltd

Access to resources Recommend Favorite

Approximation Algorithms for Multiprocessor Scheduling under Uncertainty

By Lin Guolong

Theory of Computing Systems, Vol. 47, Iss. 4, 2010-11 ,pp. : 856-877

Springer Publishing Company

Access to resources Recommend Favorite

Constant Approximation Algorithms for Rectangle Stabbing and Related Problems

By Xu Guang

Theory of Computing Systems, Vol. 40, Iss. 2, 2007-02 ,pp. : 187-204

Springer Publishing Company

Access to resources Recommend Favorite