{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:12:03Z","timestamp":1761621123604},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,2,8]],"date-time":"2013-02-08T00:00:00Z","timestamp":1360281600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00224-013-9449-0","type":"journal-article","created":{"date-parts":[[2013,2,7]],"date-time":"2013-02-07T11:49:20Z","timestamp":1360237760000},"page":"388-406","source":"Crossref","is-referenced-by-count":36,"title":["A Truthful Mechanism for Value-Based Scheduling in Cloud Computing"],"prefix":"10.1007","volume":"54","author":[{"given":"Navendu","family":"Jain","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ishai","family":"Menache","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph","family":"Naor","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Yaniv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,2,8]]},"reference":[{"key":"9449_CR1","first-page":"482","volume-title":"FOCS","author":"A. Archer","year":"2001","unstructured":"Archer, A., Tardos, \u00c9.: Truthful mechanisms for one-parameter agents. In: FOCS, pp. 482\u2013491 (2001)"},{"key":"9449_CR2","first-page":"43","volume-title":"EC","author":"M. Babaioff","year":"2010","unstructured":"Babaioff, M., Kleinberg, R., Slivkins, A.: Truthful mechanisms with implicit payment computation. In: EC, pp. 43\u201352 (2010)"},{"key":"9449_CR3","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM 48, 1069\u20131090 (2001)","journal-title":"J. ACM"},{"issue":"2","key":"9449_CR4","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1137\/S0097539799354138","volume":"31","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Guha, S., Naor, J., Schieber, B.: Approximating the throughput of multiple machines in real-time scheduling. SIAM J. Comput. 31(2), 331\u2013352 (2001)","journal-title":"SIAM J. Comput."},{"key":"9449_CR5","volume-title":"SODA","author":"X. Bei","year":"2011","unstructured":"Bei, X., Huang, Z.: Bayesian incentive compatibility via fractional assignments. In: SODA (2011)"},{"key":"9449_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24804-0","volume-title":"Scheduling Algorithms","author":"P. Brucker","year":"2004","unstructured":"Brucker, P.: Scheduling Algorithms, 4th edn. Springer, Berlin (2004)","edition":"4"},{"key":"9449_CR7","doi-asserted-by":"crossref","unstructured":"Chawla, S., Immorlica, N., Lucier, B.: On the impossibility of black-box transformations in mechanism design. CoRR abs\/1109.2067 (2011)","DOI":"10.1145\/2213977.2214019"},{"key":"9449_CR8","first-page":"775","volume-title":"FOCS","author":"S. Dughmi","year":"2010","unstructured":"Dughmi, S., Roughgarden, T.: Black-box randomized reductions in algorithmic mechanism design. In: FOCS, pp. 775\u2013784 (2010)"},{"key":"9449_CR9","first-page":"301","volume-title":"STOC","author":"J.D. Hartline","year":"2010","unstructured":"Hartline, J.D., Lucier, B.: Bayesian algorithmic mechanism design. In: STOC, pp. 301\u2013310 (2010)"},{"key":"9449_CR10","volume-title":"SODA","author":"J.D. Hartline","year":"2011","unstructured":"Hartline, J.D., Kleinberg, R., Malekian, A.: Bayesian incentive compatibility via matchings. In: SODA (2011)"},{"key":"9449_CR11","first-page":"595","volume-title":"FOCS","author":"R. Lavi","year":"2005","unstructured":"Lavi, R., Swamy, C.: Truthful and near-optimal mechanism design via linear programming. In: FOCS, pp. 595\u2013604 (2005)"},{"key":"9449_CR12","volume-title":"EC","author":"R. Lavi","year":"2007","unstructured":"Lavi, R., Swamy, C.: Truthful mechanism design for multi-dimensional scheduling via cycle monotonicity. In: EC (2007)"},{"key":"9449_CR13","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/BF02248588","volume":"26","author":"E.L. Lawler","year":"1991","unstructured":"Lawler, E.L.: A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Ann. Oper. Res. 26, 125\u2013133 (1991)","journal-title":"Ann. Oper. Res."},{"key":"9449_CR14","volume-title":"STOC","author":"N. Nisan","year":"1999","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: STOC (1999)"},{"key":"9449_CR15","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511800481","volume-title":"Algorithmic Game Theory","author":"N. Nisan","year":"2007","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., Vazirani, V.V.: Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"key":"9449_CR16","first-page":"879","volume-title":"SODA","author":"C.A. Phillips","year":"2000","unstructured":"Phillips, C.A., Uma, R.N., Wein, J.: Off-line admission control for general scheduling problems. In: SODA, pp. 879\u2013888 (2000)"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9449-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-013-9449-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-013-9449-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,29]],"date-time":"2023-06-29T09:23:22Z","timestamp":1688030602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-013-9449-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2,8]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["9449"],"URL":"https:\/\/doi.org\/10.1007\/s00224-013-9449-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2,8]]}}}