{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:57:11Z","timestamp":1743058631452,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030046118"},{"type":"electronic","value":"9783030046125"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04612-5_28","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T15:09:45Z","timestamp":1542726585000},"page":"423-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cost-Sharing Games in Real-Time Scheduling Systems"],"prefix":"10.1007","author":[{"given":"Tami","family":"Tamir","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"issue":"6","key":"28_CR1","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/1455248.1455249","volume":"55","author":"H Ackermann","year":"2008","unstructured":"Ackermann, H., R\u00f6glin, H., V\u00f6cking, B.: On the impact of combinatorial structure on congestion games. J. ACM 55(6), 25:1\u201325:22 (2008)","journal-title":"J. ACM"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1080\/08839514.2014.883906","volume":"28","author":"R Adany","year":"2014","unstructured":"Adany, R., Tamir, T.: Algorithms for battery utilization in electric vehicles. Appl. Artif. Intell. 28(3), 272\u2013291 (2014)","journal-title":"Appl. Artif. Intell."},{"issue":"6","key":"28_CR3","doi-asserted-by":"publisher","first-page":"2273","DOI":"10.1137\/070701376","volume":"38","author":"S Albers","year":"2009","unstructured":"Albers, S.: On the value of coordination in network design. SIAM J. Comput. 38(6), 2273\u20132302 (2009)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"28_CR4","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1735223.1735245","volume":"53","author":"S Albers","year":"2010","unstructured":"Albers, S.: Energy-efficient algorithms. Commun. ACM 53(5), 86\u201396 (2010)","journal-title":"Commun. ACM"},{"issue":"2","key":"28_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.geb.2008.03.005","volume":"65","author":"N Andelman","year":"2009","unstructured":"Andelman, N., Feldman, M., Mansour, Y.: Strong price of anarchy. Games Econ. Behav. 65(2), 289\u2013317 (2009)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"28_CR6","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., Tardos, E., 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":"28_CR7","doi-asserted-by":"crossref","unstructured":"Aumann, R.: Acceptable points in general cooperative n-person games. In: Contributions to the Theory of Games IV, vol. 4 (1959)","DOI":"10.1515\/9781400882168-018"},{"key":"28_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.ic.2016.08.004","volume":"251","author":"G Avni","year":"2016","unstructured":"Avni, G., Kupferman, O., Tamir, T.: Network-formation games with regular objectives. J. Inf. Comput. 251, 165\u2013178 (2016)","journal-title":"J. Inf. Comput."},{"key":"28_CR9","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.tcs.2016.07.012","volume":"646","author":"G Avni","year":"2016","unstructured":"Avni, G., Tamir, T.: Cost-sharing scheduling games on restricted unrelated machines. Theor. Comput. Sci. 646, 26\u201339 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"28_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/s001860000088","volume":"52","author":"P Baptiste","year":"2000","unstructured":"Baptiste, P.: Batching identical jobs. Math. Methods Oper. Res. 52(3), 355\u2013367 (2000)","journal-title":"Math. Methods Oper. Res."},{"issue":"2","key":"28_CR11","doi-asserted-by":"publisher","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."},{"issue":"3","key":"28_CR12","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":"4","key":"28_CR13","doi-asserted-by":"publisher","first-page":"47:1","DOI":"10.1145\/2000807.2000815","volume":"7","author":"J Chang","year":"2011","unstructured":"Chang, J., Erlebach, T., Gailis, R., Khuller, S.: Broadcast scheduling: algorithms and complexity. ACM Trans. Algorithms 7(4), 47:1\u201347:14 (2011). https:\/\/doi.org\/10.1145\/2000807.2000815. Article No. 47","journal-title":"ACM Trans. Algorithms"},{"issue":"3","key":"28_CR14","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/s00453-013-9807-y","volume":"70","author":"J Chang","year":"2014","unstructured":"Chang, J., Gabow, H.N., Khuller, S.: A model for minimizing active processor time. Algorithmica 70(3), 368\u2013405 (2014)","journal-title":"Algorithmica"},{"issue":"6","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/JSAC.2007.070813","volume":"25","author":"C Chekuri","year":"2007","unstructured":"Chekuri, C., Chuzhoy, J., Lewin-Eytan, L., Naor, J., Orda, A.: Non-cooperative multicast and facility location games. IEEE J. Sel. Areas Commun. 25(6), 1193\u20131206 (2007)","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"2","key":"28_CR16","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00224-008-9128-8","volume":"45","author":"H Chen","year":"2009","unstructured":"Chen, H., Roughgarden, T.: Network design with weighted players. Theory Comput. Syst. 45(2), 302\u2013324 (2009)","journal-title":"Theory Comput. Syst."},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-662-53354-3_9","volume-title":"Algorithmic Game Theory","author":"J de Jong","year":"2016","unstructured":"de Jong, J., Klimm, M., Uetz, M.: Efficiency of equilibria in uniform matroid congestion games. In: Gairing, M., Savani, R. (eds.) SAGT 2016. LNCS, vol. 9928, pp. 105\u2013116. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53354-3_9"},{"issue":"1","key":"28_CR18","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":"40\u201342","key":"28_CR19","doi-asserted-by":"publisher","first-page":"3553","DOI":"10.1016\/j.tcs.2010.05.011","volume":"411","author":"M Flammini","year":"2010","unstructured":"Flammini, M., Monaco, G., Moscardelli, L., Shachnai, H., Shalom, M., Tamir, T., Zaks, S.: Minimizing total busy time in parallel scheduling with application to optical networks. Theor. Comput. Sci. 411(40\u201342), 3553\u20133562 (2010)","journal-title":"Theor. Comput. Sci."},{"issue":"2\u20133","key":"28_CR20","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.tcs.2005.09.024","volume":"348","author":"D Fotakis","year":"2005","unstructured":"Fotakis, D., Kontogiannis, S., Spirakis, P.: Selfish unsplittable flows. Theor. Comput. Sci. 348(2\u20133), 226\u2013239 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/978-3-540-77105-0_42","volume-title":"Internet and Network Economics","author":"M Gairing","year":"2007","unstructured":"Gairing, M., Schoppmann, F.: Total latency in singleton congestion games. In: Deng, X., Graham, F.C. (eds.) WINE 2007. LNCS, vol. 4858, pp. 381\u2013387. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-77105-0_42"},{"issue":"6","key":"28_CR22","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. J. Oper. Res. 64(6), 1230\u20131238 (2016)","journal-title":"J. Oper. Res."},{"issue":"3","key":"28_CR23","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1287\/moor.1120.0543","volume":"37","author":"T Harks","year":"2012","unstructured":"Harks, T., Klimm, M.: On the existence of pure nash equilibria in weighted congestion games. Math. Oper. Res. 37(3), 419\u2013436 (2012)","journal-title":"Math. Oper. Res."},{"issue":"6","key":"28_CR24","doi-asserted-by":"publisher","first-page":"1491","DOI":"10.1287\/opre.1110.0979","volume":"59","author":"T Harks","year":"2011","unstructured":"Harks, T., Miller, K.: The worst-case efficiency of cost sharing methods in resource allocation games. Oper. Res. 59(6), 1491\u20131503 (2011)","journal-title":"Oper. Res."},{"key":"28_CR25","unstructured":"Ieong, S., McGrew, R., Nudelman, E., Shoham, Y., Sun, Q.: Fast and compact: a simple class of congestion games. In: Proceedings of the 20th AAAI, pp. 489\u2013494 (2005)"},{"issue":"2","key":"28_CR26","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1067309.1067324","volume":"36","author":"S Irani","year":"2005","unstructured":"Irani, S., Pruhs, K.R.: Algorithmic problems in power management. SIGACT News 36(2), 63\u201376 (2005)","journal-title":"SIGACT News"},{"key":"28_CR27","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/BF02418571","volume":"30","author":"JLWV Jensen","year":"1906","unstructured":"Jensen, J.L.W.V.: Sur les fonctions convexes et les ingalits entre les valeurs moyennes. Acta Math. 30, 175\u2013193 (1906)","journal-title":"Acta Math."},{"issue":"6","key":"28_CR28","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10951-014-0411-z","volume":"18","author":"R Khandekar","year":"2015","unstructured":"Khandekar, R., Schieber, B., Shachnai, H., Tamir, T.: Real-time scheduling to minimize machine busy time. J. Sched. 18(6), 561\u2013573 (2015)","journal-title":"J. Sched."},{"issue":"2","key":"28_CR29","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/j.cosrev.2009.04.003","volume":"3","author":"E Koutsoupias","year":"2009","unstructured":"Koutsoupias, E., Papadimitriou, C.: Worst-case equilibria. Comput. Sci. Rev. 3(2), 65\u201369 (2009)","journal-title":"Comput. Sci. Rev."},{"key":"28_CR30","doi-asserted-by":"crossref","DOI":"10.1201\/9780203489802","volume-title":"Handbook of Scheduling: Algorithms, Models, and Performance Analysis","author":"J Leung","year":"2004","unstructured":"Leung, J., Kelly, L., Anderson, J.H.: Handbook of Scheduling: Algorithms, Models, and Performance Analysis. CRC Press Inc., Boca Raton (2004)"},{"issue":"1","key":"28_CR31","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1006\/game.1996.0027","volume":"13","author":"I Milchtaich","year":"1996","unstructured":"Milchtaich, I.: Congestion games with player-specific payoff functions. Games Econ. Behav. 13(1), 111\u2013124 (1996)","journal-title":"Games Econ. Behav."},{"key":"28_CR32","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF01737559","volume":"2","author":"RW Rosenthal","year":"1973","unstructured":"Rosenthal, R.W.: A class of games possessing pure-strategy nash equilibria. Int. J. Game Theory 2, 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"key":"28_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1007\/978-3-642-17572-5_30","volume-title":"Internet and Network Economics","author":"V Syrgkanis","year":"2010","unstructured":"Syrgkanis, V.: The complexity of equilibria in cost sharing games. In: Saberi, A. (ed.) WINE 2010. LNCS, vol. 6484, pp. 366\u2013377. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-17572-5_30"},{"key":"28_CR34","doi-asserted-by":"crossref","unstructured":"V\u00f6cking, B.: Selfish load balancing. In: Algorithmic Game Theory. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511800481.022"}],"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-030-04612-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:36:10Z","timestamp":1709825770000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"21 November 2018","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":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.ox.ac.uk\/conferences\/wine2018\/","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":"Easy Chiar","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"28","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":"8","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":"24% - 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)"}}]}}