{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:18Z","timestamp":1759638198435,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319719238"},{"type":"electronic","value":"9783319719245"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-71924-5_6","type":"book-chapter","created":{"date-parts":[[2017,11,24]],"date-time":"2017-11-24T13:16:52Z","timestamp":1511529412000},"page":"74-87","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Coordination Mechanisms, Cost-Sharing, and Approximation Algorithms for Scheduling"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[]},{"given":"Vasilis","family":"Gkatzelis","sequence":"additional","affiliation":[]},{"given":"Cosimo","family":"Vinci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,11,25]]},"reference":[{"key":"6_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"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-642-33090-2_3","volume-title":"Algorithms \u2013 ESA 2012","author":"F Abed","year":"2012","unstructured":"Abed, F., Huang, C.-C.: Preemptive coordination mechanisms for unrelated machines. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 12\u201323. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33090-2_3"},{"issue":"4","key":"6_CR3","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."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Epstein, A., Mirrokni, V.S., Skopalik, A.: Fast convergence to nearly optimal solutions in potential games. In: Proceedings of the 9th ACM Conference on Electronic Commerce (EC), pp. 264\u2013273 (2008)","DOI":"10.1145\/1386790.1386832"},{"issue":"3","key":"6_CR5","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.S., Svitkina, Z.: Optimal coordination mechanisms for unrelated machine scheduling. Oper. Res. 63(3), 489\u2013500 (2015)","journal-title":"Oper. Res."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Bansal, N., Srinivasan, A., Svensson, O.: Lift-and-round to improve weighted completion time on unrelated machines. In: Proceedings of the 48th Annual ACM Symposium on Theory of Computing (STOC), pp. 156\u2013167 (2016)","DOI":"10.1145\/2897518.2897572"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., Im, S., Kulkarni, J., Munagala, K.: Coordination mechanisms from (almost) all scheduling policies. In: Proceedings of the 5th Conference on Innovations in Theoretical Computer Science (ITCS), pp. 121\u2013134 (2014)","DOI":"10.1145\/2554797.2554811"},{"issue":"3","key":"6_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"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-662-53354-3_25","volume-title":"Algorithmic Game Theory","author":"I Caragiannis","year":"2016","unstructured":"Caragiannis, I., Fanelli, A.: An almost ideal coordination mechanism for unrelated machine scheduling. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 315\u2013326. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53354-3_25"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/s00453-010-9427-8","volume":"61","author":"I Caragiannis","year":"2011","unstructured":"Caragiannis, I., Flammini, M., Kaklamanis, C., Kanellopoulos, P., Moscardelli, L.: Tight bounds for selfish and greedy load balancing. Algorithmica 61(3), 606\u2013637 (2011)","journal-title":"Algorithmica"},{"issue":"5","key":"6_CR11","doi-asserted-by":"publisher","first-page":"1799","DOI":"10.1137\/08072721X","volume":"39","author":"H Chen","year":"2010","unstructured":"Chen, H., Roughgarden, T., Valiant, G.: Designing network protocols for good equilibria. SIAM J. Comput. 39(5), 1799\u20131832 (2010)","journal-title":"SIAM J. Comput."},{"issue":"36","key":"6_CR12","doi-asserted-by":"publisher","first-page":"3327","DOI":"10.1016\/j.tcs.2009.01.005","volume":"410","author":"G Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. Theor. Comput. Sci. 410(36), 3327\u20133336 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Christodoulou, G., Gkatzelis, V., Sgouritsa, A.: Cost-sharing methods for scheduling games under uncertainty. In: Proceedings of the 18th ACM Conference on Economics and Computation (EC), pp. 441\u2013458 (2017)","DOI":"10.1145\/3033274.3085151"},{"issue":"3","key":"6_CR14","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s00453-013-9753-8","volume":"69","author":"G Christodoulou","year":"2014","unstructured":"Christodoulou, G., Mehlhorn, K., Pyrga, E.: Improving the price of anarchy for selfish routing via coordination mechanisms. Algorithmica 69(3), 619\u2013640 (2014)","journal-title":"Algorithmica"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.geb.2013.03.011","volume":"92","author":"R Cole","year":"2014","unstructured":"Cole, R., Correa, J.R., Gkatzelis, V., Mirrokni, V., Olver, N.: Decentralized utilitarian mechanisms for scheduling games. Games Econ. Behav. 92, 306\u2013326 (2014)","journal-title":"Games Econ. Behav."},{"issue":"5","key":"6_CR16","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":"6_CR17","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1287\/moor.1120.0567","volume":"38","author":"P von Falkenhausen","year":"2013","unstructured":"von Falkenhausen, P., Harks, T.: Optimal cost sharing for resource selection games. Math. Oper. Res. 38(1), 184\u2013208 (2013)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"6_CR18","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1287\/opre.2016.1512","volume":"64","author":"V Gkatzelis","year":"2016","unstructured":"Gkatzelis, V., Kollias, K., Roughgarden, T.: Optimal cost-sharing in general resource selection games. Oper. Res. 64(6), 1230\u20131238 (2016)","journal-title":"Oper. Res."},{"issue":"4","key":"6_CR19","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1287\/moor.2014.0651","volume":"39","author":"R Gopalakrishnan","year":"2014","unstructured":"Gopalakrishnan, R., Marden, J.R., Wierman, A.: Potential games are necessary to ensure pure Nash equilibria in cost sharing games. Math. Oper. Res. 39(4), 1252\u20131296 (2014)","journal-title":"Math. Oper. Res."},{"key":"6_CR20","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":"2","key":"6_CR21","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1287\/ijoc.13.2.157.10520","volume":"13","author":"H Hoogeveen","year":"2001","unstructured":"Hoogeveen, H., Schuurman, P., Woeginger, G.J.: Non-approximability results for scheduling problems with minsum criteria. INFORMS J. Comput. 13(2), 157\u2013168 (2001)","journal-title":"INFORMS J. Comput."},{"issue":"17","key":"6_CR22","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."},{"issue":"3","key":"6_CR23","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/s00224-012-9429-9","volume":"53","author":"K Kollias","year":"2013","unstructured":"Kollias, K.: Nonpreemptive coordination mechanisms for identical machines. Theory Comput. Syst. 53(3), 424\u2013440 (2013)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"6_CR24","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2781678","volume":"3","author":"K Kollias","year":"2015","unstructured":"Kollias, K., Roughgarden, T.: Restoring pure equilibria to weighted congestion games. ACM Trans. Econ. Comput. 3(4), 21:1\u201321:24 (2015)","journal-title":"ACM Trans. Econ. Comput."},{"volume-title":"Handbook of Scheduling - Algorithms, Models, and Performance Analysis","year":"2004","key":"6_CR25","unstructured":"Leung, J.Y. (ed.): Handbook of Scheduling - Algorithms, Models, and Performance Analysis. Chapman and Hall\/CRC, Boca Raton (2004)"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Li, S.: Scheduling to minimize total weighted completion time via time-indexed linear programming relaxations. CoRR abs\/1707.08039 (2017)","DOI":"10.1109\/FOCS.2017.34"},{"issue":"1","key":"6_CR27","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1287\/opre.1120.1137","volume":"61","author":"JR Marden","year":"2013","unstructured":"Marden, J.R., Wierman, A.: Distributed welfare games. Oper. Res. 61(1), 155\u2013168 (2013)","journal-title":"Oper. Res."},{"key":"6_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/978-3-642-02930-1_45","volume-title":"Automata, Languages and Programming","author":"D Mosk-Aoyama","year":"2009","unstructured":"Mosk-Aoyama, D., Roughgarden, T.: Worst-case efficiency analysis of queueing disciplines. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5556, pp. 546\u2013557. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_45"},{"issue":"3","key":"6_CR29","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/s00199-007-0275-y","volume":"36","author":"H Moulin","year":"2008","unstructured":"Moulin, H.: The price of anarchy of serial, average and incremental cost sharing. Econ. Theor. 36(3), 379\u2013405 (2008)","journal-title":"Econ. Theor."},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Sethuraman, J., Squillante, M.: Optimal scheduling of multiclass parallel machines. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 963\u2013964 (1999)","DOI":"10.1145\/301453.301483"},{"key":"6_CR31","volume-title":"Additive and Non-additive Set Functions","author":"LS Shapley","year":"1953","unstructured":"Shapley, L.S.: Additive and Non-additive Set Functions. Princeton University, Princeton (1953)"},{"issue":"2","key":"6_CR32","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1145\/375827.375840","volume":"48","author":"M Skutella","year":"2001","unstructured":"Skutella, M.: Convex quadratic and semidefinite programming relaxations in scheduling. J. ACM 48(2), 206\u2013242 (2001)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"6_CR33","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/nav.3800030106","volume":"3","author":"W Smith","year":"1956","unstructured":"Smith, W.: Various optimizers for single stage production. Naval Res. Logist. Quart. 3(1\u20132), 59\u201366 (1956)","journal-title":"Naval Res. Logist. Quart."}],"container-title":["Lecture Notes in Computer Science","Web and Internet Economics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-71924-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:50:59Z","timestamp":1709819459000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-71924-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319719238","9783319719245"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-71924-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"25 November 2017","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":"Bangalore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 December 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/lcm.csa.iisc.ernet.in\/wine2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}