{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:59:41Z","timestamp":1743141581786,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"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_6","type":"book-chapter","created":{"date-parts":[[2018,11,20]],"date-time":"2018-11-20T15:09:45Z","timestamp":1542726585000},"page":"80-95","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Timing Matters: Online Dynamics in Broadcast Games"],"prefix":"10.1007","author":[{"given":"Shuchi","family":"Chawla","sequence":"first","affiliation":[]},{"given":"Joseph","family":"Naor","sequence":"additional","affiliation":[]},{"given":"Debmalya","family":"Panigrahi","sequence":"additional","affiliation":[]},{"given":"Mohit","family":"Singh","sequence":"additional","affiliation":[]},{"given":"Seeun William","family":"Umboh","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,21]]},"reference":[{"issue":"5","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1211","DOI":"10.1137\/090748986","volume":"40","author":"S Aland","year":"2011","unstructured":"Aland, S., Dumrauf, D., Gairing, M., Monien, B., Schoppmann, F.: Exact price of anarchy for polynomial congestion games. SIAM J. Comput. 40(5), 1211\u20131233 (2011)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"6_CR2","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":"4","key":"6_CR3","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/1198513.1198522","volume":"2","author":"N Alon","year":"2006","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.: A general approach to online network optimization problems. ACM Trans. Algorithms 2(4), 640\u2013660 (2006)","journal-title":"ACM Trans. Algorithms"},{"issue":"4","key":"6_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\u20133","key":"6_CR5","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.tcs.2004.05.021","volume":"324","author":"B Awerbuch","year":"2004","unstructured":"Awerbuch, B., Azar, Y., Bartal, Y.: On-line generalized steiner problem. Theor. Comput. Sci. 324(2\u20133), 313\u2013324 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/110821317","volume":"42","author":"M-F Balcan","year":"2013","unstructured":"Balcan, M.-F., Blum, A., Mansour, Y.: Circumventing the price of anarchy: leading dynamics to good behavior. SIAM J. Comput. 42(1), 230\u2013264 (2013)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR7","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1145\/1198513.1198524","volume":"2","author":"R Beier","year":"2006","unstructured":"Beier, R., Czumaj, A., Krysta, P., V\u00f6cking, B.: Computing equilibria for a service provider game with (im)perfect information. ACM Trans. Algorithms 2(4), 679\u2013706 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Berman, P., Coulston, C.: On-line algorithms for steiner tree problems. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 344\u2013353. ACM (1997)","DOI":"10.1145\/258533.258618"},{"issue":"1\u20132","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1142\/S0219265911002824","volume":"12","author":"V Bil\u00f2","year":"2011","unstructured":"Bil\u00f2, V., Bove, R.: Bounds on the price of stability of undirected network design games with three players. J. Interconnect. Netw. 12(1\u20132), 1\u201317 (2011)","journal-title":"J. Interconnect. Netw."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Bil\u00f2, V., Flammini, M., Moscardelli, L.: The price of stability for undirected broadcast network design with fair cost allocation is constant. In: FOCS, pp. 638\u2013647 (2013)","DOI":"10.1109\/FOCS.2013.74"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Charikar, M., Karloff, H.J., Mathieu, C., Naor, J., Saks, M.E.: Online multicast with egalitarian cost sharing. In: SPAA, pp. 70\u201376 (2008)","DOI":"10.1145\/1378533.1378544"},{"key":"6_CR12","unstructured":"Chawla, S., Naor, J., Panigrahi, D., Singh, M., Umboh, S.W.: Timing matters: online dynamics in broadcast games. CoRR, abs\/1611.07745 (2016). http:\/\/arxiv.org\/abs\/1611.07745"},{"issue":"6","key":"6_CR13","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.(Seffi), Orda, A.: Non-cooperative multicast and facility location games. IEEE J. Sel. Areas Commun. 25(6), 1193\u20131206 (2007)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"2","key":"6_CR14","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00224-008-9128-8","volume":"45","author":"H-L Chen","year":"2009","unstructured":"Chen, H.-L., Roughgarden, T.: Network design with weighted players. Theory Comput. Syst. 45(2), 302\u2013324 (2009)","journal-title":"Theory Comput. Syst."},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-12450-1_8","volume-title":"Approximation and Online Algorithms","author":"G Christodoulou","year":"2010","unstructured":"Christodoulou, G., Chung, C., Ligett, K., Pyrga, E., van Stee, R.: On the price of stability for undirected network design. In: Bampis, E., Jansen, K. (eds.) WAOA 2009. LNCS, vol. 5893, pp. 86\u201397. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12450-1_8"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Ene, A., Chakrabarty, D., Krishnaswamy, R., Panigrahi, D.: Online buy-at-bulk network design. In: IEEE 56th Annual Symposium on Foundations of Computer Science, FOCS 2015, Berkeley, CA, USA, 17\u201320 October, 2015, pp. 545\u2013562 (2015)","DOI":"10.1109\/FOCS.2015.40"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Fabrikant, A., Papadimitriou, C.H., Talwar, K.: The complexity of pure Nash equilibria. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, 13\u201316 June 2004, pp. 604\u2013612 (2004)","DOI":"10.1145\/1007352.1007445"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/j.tcs.2014.09.035","volume":"562","author":"A Fanelli","year":"2015","unstructured":"Fanelli, A., Leniowski, D., Monaco, G., Sankowski, P.: The ring design game with fair cost allocation. Theor. Comput. Sci. 562, 90\u2013100 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/11786986_53","volume-title":"Automata, Languages and Programming","author":"A Fiat","year":"2006","unstructured":"Fiat, A., Kaplan, H., Levy, M., Olonetsky, S., Shabo, R.: On the price of stability for designing undirected networks with fair cost allocations. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 608\u2013618. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11786986_53"},{"key":"6_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/978-3-662-54110-4_25","volume-title":"Web and Internet Economics","author":"R Freeman","year":"2016","unstructured":"Freeman, R., Haney, S., Panigrahi, D.: On the Price of stability of undirected multicast games. In: Cai, Y., Vetta, A. (eds.) WINE 2016. LNCS, vol. 10123, pp. 354\u2013368. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-54110-4_25"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Gupta, A., Ravi, R., Talwar, K., Umboh, S.W.: LAST but not least: online spanners for buy-at-bulk. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017, 16\u201319 January, Hotel Porta Fira, Barcelona, Spain, pp. 589\u2013599 (2017)","DOI":"10.1137\/1.9781611974782.38"},{"key":"6_CR22","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Liaghat, V., Panigrahi, D.: Online node-weighted steiner forest and extensions via disk paintings. In: FOCS, pp. 558\u2013567 (2013)","DOI":"10.1109\/FOCS.2013.66"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-662-43948-7_48","volume-title":"Automata, Languages, and Programming","author":"MT Hajiaghayi","year":"2014","unstructured":"Hajiaghayi, M.T., Liaghat, V., Panigrahi, D.: Near-optimal online algorithms for prize-collecting steiner problems. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 576\u2013587. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_48"},{"issue":"3","key":"6_CR24","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":"3","key":"6_CR25","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M Imase","year":"1991","unstructured":"Imase, M., Waxman, B.M.: Dynamic steiner tree problem. SIAM J. Discrete Math. 4(3), 369\u2013384 (1991)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR26","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.tcs.2013.02.031","volume":"482","author":"Y Kawase","year":"2013","unstructured":"Kawase, Y., Makino, K.: Nash equilibria with minimum potential in undirected broadcast games. Theor. Comput. Sci. 482, 33\u201347 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Lee, E., Ligett, K.: Improved bounds on the price of stability in network cost sharing games. In: EC, pp. 607\u2013620 (2013)","DOI":"10.1145\/2482540.2482562"},{"issue":"15","key":"6_CR28","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1016\/j.ipl.2009.04.015","volume":"109","author":"J Li","year":"2009","unstructured":"Li, J.: An O(log(n)\/log(log(n))) upper bound on the price of stability for undirected shapley network design games. Inf. Process. Lett. 109(15), 876\u2013878 (2009)","journal-title":"Inf. Process. Lett."},{"key":"6_CR29","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 function. Games Econ. Behav. 13, 111\u2013124 (1996)","journal-title":"Games Econ. Behav."},{"key":"6_CR30","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.: Potential games. Games Econ. Behav. 14, 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"key":"6_CR31","doi-asserted-by":"crossref","unstructured":"Naor, J., Panigrahi, D., Singh, M.: Online node-weighted steiner tree and related problems. In: FOCS, pp. 210\u2013219 (2011)","DOI":"10.1109\/FOCS.2011.65"},{"issue":"11","key":"6_CR32","doi-asserted-by":"publisher","first-page":"3335","DOI":"10.1007\/s00453-017-0391-4","volume":"80","author":"J Qian","year":"2018","unstructured":"Qian, J., Umboh, S.W., Williamson, D.P.: Online constrained forest and prize-collecting network design. Algorithmica 80(11), 3335\u20133364 (2018)","journal-title":"Algorithmica"},{"key":"6_CR33","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1006\/game.1997.0592","volume":"21","author":"N Law-Yone","year":"1997","unstructured":"Law-Yone, N., Holzman, R.: Strong equilibrium in congestion games. Games Econ. Behav. 21, 85\u2013101 (1997)","journal-title":"Games Econ. Behav."},{"issue":"1","key":"6_CR34","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(1), 65\u201367 (1973)","journal-title":"Int. J. Game Theory"},{"issue":"1","key":"6_CR35","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1006\/game.1999.0729","volume":"31","author":"T Ui","year":"2000","unstructured":"Ui, T.: A shapley value representation of potential games. Games Econ. Behav. 31(1), 121\u2013135 (2000)","journal-title":"Games Econ. Behav."},{"key":"6_CR36","doi-asserted-by":"crossref","unstructured":"Umboh, S.: Online network design algorithms via hierarchical decompositions. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1373\u20131387. SIAM (2015)","DOI":"10.1137\/1.9781611973730.91"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:33:48Z","timestamp":1709825628000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04612-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046118","9783030046125"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04612-5_6","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)"}}]}}