{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T10:43:07Z","timestamp":1742985787639,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030649456"},{"type":"electronic","value":"9783030649463"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-64946-3_22","type":"book-chapter","created":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:03:39Z","timestamp":1607159019000},"page":"309-322","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Sequential Solutions in Machine Scheduling Games"],"prefix":"10.1007","author":[{"given":"Cong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Giessler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Akaki","family":"Mamageishvili","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mat\u00fa\u0161","family":"Mihal\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,12,6]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-662-44777-2_2","volume-title":"Algorithms - ESA 2014","author":"F Abed","year":"2014","unstructured":"Abed, F., Correa, J.R., Huang, C.-C.: Optimal coordination mechanisms for multi-job scheduling games. In: Schulz, A.S., Wagner, D. (eds.) ESA 2014. LNCS, vol. 8737, pp. 13\u201324. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44777-2_2"},{"issue":"65","key":"22_CR2","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"2","author":"N Andelman","year":"2009","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games Econ. Behav. 2(65), 289\u2013317 (2009)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"22_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10878-013-9694-9","volume":"29","author":"A Angelucci","year":"2013","unstructured":"Angelucci, A., Bil\u00f2, V., Flammini, M., Moscardelli, L.: On the sequential price of anarchy of isolation games. J. Comb. Optim. 29(1), 165\u2013181 (2013). https:\/\/doi.org\/10.1007\/s10878-013-9694-9","journal-title":"J. Comb. Optim."},{"issue":"4","key":"22_CR4","doi-asserted-by":"publisher","first-page":"1602","DOI":"10.1137\/070680096","volume":"38","author":"E Anshelevich","year":"2008","unstructured":"Anshelevich, E., Dasgupta, A., Kleinberg, J.M., Tardos, \u00c9., Wexler, T., Roughgarden, T.: The price of stability for network design with fair cost allocation. SIAM J. Comput. 38(4), 1602\u20131623 (2008)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"22_CR5","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1016\/j.tcs.2006.05.010","volume":"361","author":"B Awerbuch","year":"2006","unstructured":"Awerbuch, B., Azar, Y., Richter, Y., Tsur, D.: Tradeoffs in worst-case equilibria. Theoret. Comput. Sci. 361(2), 200\u2013209 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"3","key":"22_CR6","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1287\/opre.2015.1363","volume":"63","author":"Y Azar","year":"2015","unstructured":"Azar, Y., Fleischer, L., Jain, K., Mirrokni, V., Svitkina, Z.: Optimal coordination mechanisms for unrelated machine scheduling. Oper. Res. 63(3), 489\u2013500 (2015)","journal-title":"Oper. Res."},{"issue":"1","key":"22_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-38016-7_19","volume":"56","author":"V Bil\u00f2","year":"2015","unstructured":"Bil\u00f2, V., Flammini, M., Monaco, G., Moscardelli, L.: Some anomalies of farsighted strategic behavior. Theory Comput. Syst. 56(1), 156\u2013180 (2015). https:\/\/doi.org\/10.1007\/978-3-642-38016-7_19","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"22_CR8","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s00453-012-9650-6","volume":"66","author":"I Caragiannis","year":"2013","unstructured":"Caragiannis, I.: Efficient coordination mechanisms for unrelated machine scheduling. Algorithmica 66(3), 512\u2013540 (2013)","journal-title":"Algorithmica"},{"issue":"1","key":"22_CR9","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/s00224-018-9857-2","volume":"63","author":"I Caragiannis","year":"2018","unstructured":"Caragiannis, I., Fanelli, A.: An almost ideal coordination mechanism for unrelated machine scheduling. Theory Comput. Syst. 63(1), 114\u2013127 (2018). https:\/\/doi.org\/10.1007\/s00224-018-9857-2","journal-title":"Theory Comput. Syst."},{"key":"22_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_25","volume-title":"Handbook of Combinatorial Optimization","author":"B Chen","year":"1998","unstructured":"Chen, B., Potts, C.N., Woeginger, G.J.: A review of machine scheduling: complexity, algorithms and approximability. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_25"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. Theor. Comput. Sci. 410(36), 3327\u20133336 (2009). Graphs, Games and Computation: Dedicated to Professor Burkhard Monien on the Occasion of his 65th Birthday","DOI":"10.1016\/j.tcs.2009.01.005"},{"key":"22_CR12","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.geb.2013.03.011","volume":"92","author":"R Cole","year":"2015","unstructured":"Cole, R., Correa, J.R., Gkatzelis, V., Mirrokni, V., Olver, N.: Decentralized utilitarian mechanisms for scheduling games. Games Econ. Behav. 92, 306\u2013326 (2015)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"1286","DOI":"10.1287\/moor.2018.0968","volume":"44","author":"JR Correa","year":"2019","unstructured":"Correa, J.R., de Jong, J., de Keijzer, B., Uetz, M.: The inefficiency of Nash and subgame perfect equilibria for network routing. Math. Oper. Res. 44(4), 1286\u20131303 (2019)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"22_CR14","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1002\/nav.21497","volume":"59","author":"JR Correa","year":"2012","unstructured":"Correa, J.R., Queyranne, M.: Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost. Naval Res. Logist. (NRL) 59(5), 384\u2013395 (2012)","journal-title":"Naval Res. Logist. (NRL)"},{"issue":"1","key":"22_CR15","doi-asserted-by":"publisher","first-page":"4:1","DOI":"10.1145\/1186810.1186814","volume":"3","author":"A Czumaj","year":"2007","unstructured":"Czumaj, A., V\u00f6cking, B.: Tight bounds for worst-case equilibria. ACM Trans. Algorithms 3(1), 4:1\u20134:17 (2007)","journal-title":"ACM Trans. Algorithms"},{"issue":"7","key":"22_CR16","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s00236-010-0124-5","volume":"47","author":"L Epstein","year":"2010","unstructured":"Epstein, L.: Equilibria for two parallel links: the strong price of anarchy versus the price of anarchy. Acta Informatica 47(7), 375\u2013389 (2010)","journal-title":"Acta Informatica"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/3-540-45061-0_41","volume-title":"Automata, Languages and Programming","author":"E Even-Dar","year":"2003","unstructured":"Even-Dar, E., Kesselman, A., Mansour, Y.: Convergence time to Nash equilibria. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 502\u2013513. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_41"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45061-0_42","volume-title":"Automata, Languages and Programming","author":"R Feldmann","year":"2003","unstructured":"Feldmann, R., Gairing, M., L\u00fccking, T., Monien, B., Rode, M.: Nashification and the coordination ratio for a selfish routing game. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 514\u2013526. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-45061-0_42"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/978-3-540-73420-8_51","volume-title":"Automata, Languages and Programming","author":"A Fiat","year":"2007","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S.: Strong price of anarchy for machine load balancing. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 583\u2013594. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73420-8_51"},{"issue":"3","key":"22_CR20","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/BF01930985","volume":"19","author":"G Finn","year":"1979","unstructured":"Finn, G., Horowitz, E.: A linear time approximation algorithm for multiprocessor scheduling. BIT Numer. Math. 19(3), 312\u2013320 (1979). https:\/\/doi.org\/10.1007\/BF01930985","journal-title":"BIT Numer. Math."},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-45465-9_12","volume-title":"Automata, Languages and Programming","author":"D Fotakis","year":"2002","unstructured":"Fotakis, D., Kontogiannis, S., Koutsoupias, E., Mavronicolas, M., Spirakis, P.: The structure and complexity of Nash equilibria for a selfish routing game. In: Widmayer, P., Eidenbenz, S., Triguero, F., Morales, R., Conejo, R., Hennessy, M. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 123\u2013134. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45465-9_12"},{"issue":"5","key":"22_CR22","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.orl.2015.08.003","volume":"43","author":"R Hassin","year":"2015","unstructured":"Hassin, R., Yovel, U.: Sequential scheduling on identical machines. Oper. Res. Lett. 43(5), 530\u2013533 (2015)","journal-title":"Oper. Res. Lett."},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-29116-6_22","volume-title":"Approximation and Online Algorithms","author":"R Hoeksma","year":"2012","unstructured":"Hoeksma, R., Uetz, M.: The price of anarchy for Minsum related machine scheduling. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 261\u2013273. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29116-6_22"},{"issue":"17","key":"22_CR24","doi-asserted-by":"publisher","first-page":"1589","DOI":"10.1016\/j.tcs.2008.12.032","volume":"410","author":"N Immorlica","year":"2009","unstructured":"Immorlica, N., Li, L.E., Mirrokni, V.S., Schulz, A.S.: Coordination mechanisms for selfish scheduling. Theoret. Comput. Sci. 410(17), 1589\u20131598 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-319-13129-0_35","volume-title":"Web and Internet Economics","author":"J de Jong","year":"2014","unstructured":"de Jong, J., Uetz, M.: The sequential price of anarchy for atomic congestion games. In: Liu, T.-Y., Qi, Q., Ye, Y. (eds.) WINE 2014. LNCS, vol. 8877, pp. 429\u2013434. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13129-0_35"},{"issue":"6","key":"22_CR26","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/s00224-003-1131-5","volume":"36","author":"E Koutsoupias","year":"2003","unstructured":"Koutsoupias, E., Mavronicolas, M., Spirakis, P.: Approximate equilibria and ball fusion. Theory Comput. Syst. 36(6), 683\u2013693 (2003). https:\/\/doi.org\/10.1007\/s00224-003-1131-5","journal-title":"Theory Comput. Syst."},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/3-540-49116-3_38","volume-title":"STACS 99","author":"E Koutsoupias","year":"1999","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 404\u2013413. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_38"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Leme, R.P., Syrgkanis, V., Tardos, \u00c9.: The curse of simultaneity. In: Proceedings of Innovations in Theoretical Computer Science (ITCS), pp. 60\u201367 (2012)","DOI":"10.1145\/2090236.2090242"},{"key":"22_CR29","doi-asserted-by":"publisher","unstructured":"Pinedo, M., Hadavi, K.: Scheduling: theory, algorithms and systems development. In: Gaul, W., Bachem, A., Habenicht, W., Runge, W., Stahl, W.W. (eds.) Operations Research Proceedings 1991. Operations Research Proceedings 1991, vol 1991. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-46773-8_5","DOI":"10.1007\/978-3-642-46773-8_5"},{"issue":"1","key":"22_CR30","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1006\/game.1997.0564","volume":"22","author":"T Tran\u00e6s","year":"1998","unstructured":"Tran\u00e6s, T.: Tie-breaking in games of perfect information. Games Econ. Behav. 22(1), 148\u2013161 (1998)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"22_CR31","doi-asserted-by":"publisher","first-page":"949","DOI":"10.1007\/s11590-018-1285-3","volume":"13","author":"L Zhang","year":"2018","unstructured":"Zhang, L., Zhang, Y., Du, D., Bai, Q.: Improved price of anarchy for machine scheduling games with coordination mechanisms. Optim. Lett. 13(4), 949\u2013959 (2018). https:\/\/doi.org\/10.1007\/s11590-018-1285-3","journal-title":"Optim. Lett."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-64946-3_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,5]],"date-time":"2020-12-05T09:13:39Z","timestamp":1607159619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-64946-3_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030649456","9783030649463"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-64946-3_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 December 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WINE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Web and Internet Economics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 December 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 December 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/econcs.pku.edu.cn\/wine2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"136","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"23% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}