{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:45:08Z","timestamp":1767339908790},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,5,19]],"date-time":"2018-05-19T00:00:00Z","timestamp":1526688000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10951-018-0568-y","type":"journal-article","created":{"date-parts":[[2018,5,19]],"date-time":"2018-05-19T09:08:14Z","timestamp":1526720894000},"page":"359-377","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Multistage interval scheduling games"],"prefix":"10.1007","volume":"22","author":[{"given":"Arne","family":"Herzel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Hopf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clemens","family":"Thielen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,19]]},"reference":[{"key":"568_CR1","doi-asserted-by":"crossref","unstructured":"Andelman, N., Azar, Y., & Sorani, M. (2005). Truthful approximation mechanisms for scheduling selfish related machines. In Proceedings of the 22nd international symposium on theoretical aspects of computer science (STACS), volume 3404 of LNCS (pp. 69\u201382).","DOI":"10.1007\/978-3-540-31856-9_6"},{"key":"568_CR2","unstructured":"Andelman, N., Feldman, M., & Mansour, Y. (2007). Strong price of anarchy. In Proceedings of the 18th ACM-SIAM symposium on discrete algorithms (SODA) (pp. 189\u2013198)."},{"key":"568_CR3","doi-asserted-by":"crossref","unstructured":"Archer, A., & Tardos, \u00c9. (2001). Truthful mechanisms for one-parameter agents. In Proceedings of the 42nd annual IEEE symposium on the foundations of computer science (FOCS) (pp. 482\u2013491).","DOI":"10.1109\/SFCS.2001.959924"},{"issue":"1","key":"568_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"EM Arkin","year":"1987","unstructured":"Arkin, E. M., & Silverberg, E. B. (1987). Scheduling jobs with fixed start and end times. Discrete Applied Mathematics, 18(1), 1\u20138.","journal-title":"Discrete Applied Mathematics"},{"key":"568_CR5","doi-asserted-by":"crossref","unstructured":"Auletta, V., De Prisco, R., Penna, P., & Persiano, G. (2004). Deterministic truthful approximation mechanisms for scheduling related machines. In Proceedings of the 21st international symposium on theoretical aspects of computer science (STACS), volume 2996 of LNCS (pp. 608\u2013619).","DOI":"10.1007\/978-3-540-24749-4_53"},{"issue":"3\u20134","key":"568_CR6","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF00121680","volume":"9","author":"KI Bouzina","year":"1996","unstructured":"Bouzina, K. I., & Emmons, H. (1996). Interval scheduling on identical machines. Journal of Global Optimization, 9(3\u20134), 379\u2013393.","journal-title":"Journal of Global Optimization"},{"key":"568_CR7","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P. (2007). Scheduling algorithms (5th ed.). Berlin: Springer.","edition":"5"},{"issue":"4","key":"568_CR8","doi-asserted-by":"publisher","first-page":"993","DOI":"10.1137\/S0097539795283292","volume":"27","author":"R Canetti","year":"1998","unstructured":"Canetti, R., & Irani, S. (1998). Bounding the power of preemption in randomized scheduling. SIAM Journal on Computing, 27(4), 993\u20131015.","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"568_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0166-218X(95)80003-M","volume":"59","author":"MC Carlisle","year":"1995","unstructured":"Carlisle, M. C., & Lloyd, E. L. (1995). On the \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -coloring of intervals. Discrete Applied Mathematics, 59(3), 225\u2013235.","journal-title":"Discrete Applied Mathematics"},{"key":"568_CR10","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E., & Nanavati, A. (2004). Coordination mechanisms. In International colloquium on automata languages and programming (ICALP) (pp. 345\u2013357).","DOI":"10.1007\/978-3-540-27836-8_31"},{"issue":"1","key":"568_CR11","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00224-011-9316-9","volume":"49","author":"J Cohen","year":"2011","unstructured":"Cohen, J., D\u00fcrr, C., & Nguyen, K. T. (2011). Non-clairvoyant scheduling games. Theory of Computing Systems, 49(1), 3\u201323.","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"568_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1186810.1186814","volume":"3","author":"A Czumaj","year":"2009","unstructured":"Czumaj, A., & V\u00f6cking, B. (2009). Tight bounds for worst-case equilibria. ACM Transactions on Algorithms, 3(1), 1\u201317.","journal-title":"ACM Transactions on Algorithms"},{"key":"568_CR13","doi-asserted-by":"crossref","unstructured":"Epstein, L., & Kleiman, E. (2014). Scheduling selfish jobs on multidimensional parallel machines. In Proceedings of the 26th annual acm symposium on parallelism in algorithms and architectures (SPAA) (pp. 108\u2013117).","DOI":"10.1145\/2612669.2612683"},{"key":"568_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ic.2012.01.005","volume":"212","author":"L Epstein","year":"2012","unstructured":"Epstein, L., & van Stee, R. (2012). The price of anarchy on uniformly related machines revisited. Information and Computation, 212, 37\u201354.","journal-title":"Information and Computation"},{"issue":"1","key":"568_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/0166-218X(95)00112-5","volume":"58","author":"U Faigle","year":"1995","unstructured":"Faigle, U., & Nawjin, W. M. (1995). Note on scheduling intervals online. Discrete Applied Mathematics, 58(1), 13\u201317.","journal-title":"Discrete Applied Mathematics"},{"issue":"2","key":"568_CR16","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1016\/j.ejor.2016.12.047","volume":"17","author":"M Hopf","year":"2017","unstructured":"Hopf, M., Thielen, C., & Wendt, O. (2017). Competitive algorithms for multistage online scheduling. European Journal of Operational Research, 17(2), 468\u2013481.","journal-title":"European Journal of Operational Research"},{"key":"568_CR17","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1002\/nav.20231","volume":"54","author":"AWJ Kolen","year":"2007","unstructured":"Kolen, A. W. J., Lenstra, J. K., Papadimitriou, C., & Spieksma, F. C. R. (2007). Interval scheduling: A survey. Naval Research Logistics, 54, 530\u2013543.","journal-title":"Naval Research Logistics"},{"key":"568_CR18","doi-asserted-by":"crossref","unstructured":"Koutsoupias, E., & Papadimitriou, C. (1999). Worst-case equilibria. In Proceedings of the 16th international symposium on theoretical aspects of computer science (STACS)","DOI":"10.1007\/3-540-49116-3_38"},{"key":"568_CR19","doi-asserted-by":"crossref","unstructured":"Kov\u00e1cs, A. (2005). Fast monotone 3-approximation algorithm for scheduling related machines. In Proceedings of the 13th annual european symposium on algorithms (ESA), volume 3669 of LNCS (pp. 616\u2013627).","DOI":"10.1007\/11561071_55"},{"issue":"2","key":"568_CR20","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"MY Kovalyov","year":"2007","unstructured":"Kovalyov, M. Y., Ng, C. T., & Cheng, T. C. E. (2007). Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research, 178(2), 331\u2013342.","journal-title":"European Journal of Operational Research"},{"key":"568_CR21","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1006\/game.1996.0044","volume":"14","author":"D Monderer","year":"1996","unstructured":"Monderer, D., & Shapley, L. S. (1996). Potential games. Games and Economic Behavior, 14, 124\u2013143.","journal-title":"Games and Economic Behavior"},{"issue":"2","key":"568_CR22","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J. (1951). Non-cooperative games. Annals of Mathematics, 54(2), 286\u2013295.","journal-title":"Annals of Mathematics"},{"key":"568_CR23","doi-asserted-by":"crossref","unstructured":"Nisan, N., Roughgarden, T., Tardos, \u00c9., & Vazirani, V. V. (Eds.). (2007). Algorithmic Game Theory. Cambridge University Press.","DOI":"10.1017\/CBO9780511800481"},{"issue":"1","key":"568_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R. W. (1973). A class of games possessing pure-strategy Nash equilibria. International Journal of Game Theory, 2(1), 65\u201367.","journal-title":"International Journal of Game Theory"},{"key":"568_CR25","doi-asserted-by":"crossref","unstructured":"Thielen, C., & Krumke, S. O. (2008) A general scheme for designing monotone algorithms for scheduling problems with precedence constraints. In Proceedings of the 6th workshop on approximation and online algorithms (WAOA), volume 5426 of LNCS (pp. 105\u2013118).","DOI":"10.1007\/978-3-540-93980-1_9"},{"issue":"1","key":"568_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/0304-3975(94)90150-3","volume":"130","author":"GJ Woeginger","year":"1994","unstructured":"Woeginger, G. J. (1994). Online scheduling of jobs with fixed start and end times. Theoretical Computer Science, 130(1), 5\u201316.","journal-title":"Theoretical Computer Science"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0568-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-018-0568-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-018-0568-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,5]],"date-time":"2019-09-05T05:53:30Z","timestamp":1567662810000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-018-0568-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,19]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["568"],"URL":"https:\/\/doi.org\/10.1007\/s10951-018-0568-y","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,19]]},"assertion":[{"value":"19 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}