{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:53:16Z","timestamp":1742381596454},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_6","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:06:19Z","timestamp":1267535179000},"page":"69-82","source":"Crossref","is-referenced-by-count":42,"title":["Truthful Approximation Mechanisms for Scheduling Selfish Related Machines"],"prefix":"10.1007","author":[{"given":"Nir","family":"Andelman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yossi","family":"Azar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Motti","family":"Sorani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<55::AID-JOS2>3.0.CO;2-J","volume":"1","author":"N. Alon","year":"1998","unstructured":"Alon, N., Azar, Y., Woeginger, G., Yadid, T.: Approximation schemes for scheduling on parallel machines. Journal of Scheduling\u00a01(1), 55\u201366 (1998)","journal-title":"Journal of Scheduling"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/978-3-540-31833-0_22","volume-title":"Approximation and Online Algorithms","author":"P. Ambrosio","year":"2005","unstructured":"Ambrosio, P., Auletta, E.: Deterministic monotone algorithms for scheduling on related machines. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol.\u00a03351, pp. 267\u2013280. Springer, Heidelberg (2005)"},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"482","DOI":"10.1109\/SFCS.2001.959924","volume-title":"Proceedings of the 42nd IEEE symposium on Foundations of Computer Science","author":"A. Archer","year":"2001","unstructured":"Archer, A., Tardos, E.: Truthful mechanisms for one-parameter agents. In: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, p. 482. IEEE Computer Society Press, Los Alamitos (2001)"},{"unstructured":"Archer, A.: Mechanisms for Discrete Optimization with Rational Agents. PhD thesis, Cornell University (2004)","key":"6_CR4"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-540-24749-4_53","volume-title":"STACS 2004","author":"V. Auletta","year":"2004","unstructured":"Auletta, V., Prisco, R.D., Penna, P., Persiano, P.: Deterministic truthful approximation mechanisms for scheduling related machines. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 608\u2013619. Springer, Heidelberg (2004)"},{"doi-asserted-by":"crossref","unstructured":"Clarke, E.: Multipart pricing of public goods. Public Choice (1971)","key":"6_CR6","DOI":"10.1007\/BF01726210"},{"key":"6_CR7","first-page":"151","volume-title":"Proceedings of the 7th Annual European Symposium on Algorithms","author":"L. Epstein","year":"1999","unstructured":"Epstein, L., Sgall, J.: Approximation schemes for scheduling on uniformly related and identical parallel machines. In: Proceedings of the 7th Annual European Symposium on Algorithms, pp. 151\u2013162. Springer, Heidelberg (1999)"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1137\/0206013","volume":"6","author":"T. Gonzalez","year":"1977","unstructured":"Gonzalez, T., Ibarra, O.H., Sahni, S.: Bounds for LPT schedules on uniform processors. SIAM Journal on Computing\u00a06(1), 155\u2013166 (1977)","journal-title":"SIAM Journal on Computing"},{"doi-asserted-by":"crossref","unstructured":"Groves, T.: Incentives in teams. Econemetrica (1973)","key":"6_CR9","DOI":"10.2307\/1914085"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0217033","volume":"17","author":"D. Hochbaum","year":"1988","unstructured":"Hochbaum, D., Shmoys, D.: A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach. SIAM Journal on Computing\u00a017(3), 539\u2013551 (1988)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR11","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","volume":"23","author":"E. Horowitz","year":"1976","unstructured":"Horowitz, E., Sahni, S.: Exact and approximate algorithms for scheduling non-identical processors. Journal of the Association for Computing Machinery\u00a023, 317\u2013327 (1976)","journal-title":"Journal of the Association for Computing Machinery"},{"doi-asserted-by":"crossref","unstructured":"Nisan, N., Ronen, A.: Algorithmic mechanism design. In: 31st ACM Symp. on Theory of Computing, pp. 129\u2013140 (1999)","key":"6_CR12","DOI":"10.1145\/301250.301287"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1145\/352871.352898","volume-title":"Proceedings of the 2nd ACM conference on Electronic commerce","author":"N. Nisan","year":"2000","unstructured":"Nisan, N., Ronen, A.: Computationally feasible vcg mechanisms. In: Proceedings of the 2nd ACM conference on Electronic commerce, pp. 242\u2013252. ACM Press, New York (2000)"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1145\/380752.380883","volume-title":"Proceedings of the thirty-third annual ACM symposium on Theory of computing","author":"C. Papadimitriou","year":"2001","unstructured":"Papadimitriou, C.: Algorithms, games, and the internet. In: Proceedings of the thirty-third annual ACM symposium on Theory of computing, pp. 749\u2013753. ACM Press, New York (2001)"},{"doi-asserted-by":"crossref","unstructured":"Tardos, E.: Network games. In: Proceedings of the Annual ACM Symposium on Theory of Computing (2004)","key":"6_CR15","DOI":"10.1145\/1007352.1007356"},{"doi-asserted-by":"crossref","unstructured":"Vickery, W.: Counterspeculation, auctions and competitive sealed tenders. Journal of Finance (1961)","key":"6_CR16","DOI":"10.1111\/j.1540-6261.1961.tb02789.x"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:29:55Z","timestamp":1605742195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}