{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:58:45Z","timestamp":1743044325765,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030261757"},{"type":"electronic","value":"9783030261764"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-26176-4_44","type":"book-chapter","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T23:02:56Z","timestamp":1563922976000},"page":"529-540","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The One-Round Multi-player Discrete Voronoi Game on Grids and Trees"],"prefix":"10.1007","author":[{"given":"Xiaoming","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyu","family":"Xia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jialin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,21]]},"reference":[{"issue":"1\u20133","key":"44_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.tcs.2003.09.004","volume":"310","author":"H Ahn","year":"2004","unstructured":"Ahn, H., Cheng, S., Cheong, O., Golin, M., Van Oostrum, R.: Competitive facility location: the Voronoi game. Theoret. Comput. Sci. 310(1\u20133), 457\u2013467 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"6","key":"44_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ipl.2009.12.009","volume":"110","author":"N Alon","year":"2010","unstructured":"Alon, N., Feldman, M., Procaccia, A.D., Tennenholtz, M.: A note on competitive diffusion through social networks. Inf. Process. Lett. 110(6), 221\u2013225 (2010)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"44_CR3","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1007\/s10878-011-9447-6","volume":"26","author":"A Banik","year":"2013","unstructured":"Banik, A., Bhattacharya, B.B., Das, S.: Optimal strategies for the one-round discrete Voronoi game on a line. J. Comb. Optim. 26(4), 655\u2013669 (2013)","journal-title":"J. Comb. Optim."},{"key":"44_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-38756-2_22","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"A Banik","year":"2013","unstructured":"Banik, A., Bhattacharya, B.B., Das, S., Das, S.: Two-round discrete voronoi game along a line. In: Fellows, M., Tan, X., Zhu, B. (eds.) AAIM\/FAW -2013. LNCS, vol. 7924, pp. 210\u2013220. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38756-2_22"},{"key":"44_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.comgeo.2017.02.003","volume":"63","author":"A Banik","year":"2017","unstructured":"Banik, A., Bhattacharya, B.B., Das, S., Mukherjee, S.: The discrete Voronoi game in R2. Comput. Geom. 63, 53\u201362 (2017)","journal-title":"Comput. Geom."},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.comgeo.2016.02.002","volume":"55","author":"A Banik","year":"2016","unstructured":"Banik, A., De Carufel, J.L., Maheshwari, A., Smid, M.: Discrete Voronoi games and $$\\epsilon $$-nets, in two and three dimensions. Comput. Geom. 55, 41\u201358 (2016)","journal-title":"Comput. Geom."},{"key":"44_CR7","unstructured":"de Berg, M., Kisfaludi-Bak, S., Mehr, M.: On one-round discrete Voronoi games. arXiv preprint arXiv:1902.09234 (2019)"},{"issue":"3","key":"44_CR8","first-page":"36","volume":"14","author":"MD Berg","year":"2018","unstructured":"Berg, M.D., Gudmundsson, J., Mehr, M.: Faster algorithms for computing plurality points. ACM Trans. Algorithms (TALG) 14(3), 36 (2018)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"44_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-319-17142-5_18","volume-title":"Theory and Applications of Models of Computation","author":"L Bulteau","year":"2015","unstructured":"Bulteau, L., Froese, V., Talmon, N.: Multi-player diffusion games on graph classes. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 200\u2013211. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17142-5_18"},{"issue":"1","key":"44_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00454-003-2951-4","volume":"31","author":"O Cheong","year":"2004","unstructured":"Cheong, O., Har-Peled, S., Linial, N., Matousek, J.: The one-round Voronoi game. Discrete Comput. Geom. 31(1), 125\u2013138 (2004)","journal-title":"Discrete Comput. Geom."},{"key":"44_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-75520-3_4","volume-title":"Algorithms \u2013 ESA 2007","author":"C D\u00fcrr","year":"2007","unstructured":"D\u00fcrr, C., Thang, N.K.: Nash equilibria in Voronoi games on graphs. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 17\u201328. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75520-3_4"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Etesami, S.R., Basar, T.: Complexity of equilibrium in diffusion games on social networks. In: American Control Conference (ACC), pp. 2065\u20132070. IEEE (2014)","DOI":"10.1109\/ACC.2014.6859194"},{"issue":"2","key":"44_CR13","doi-asserted-by":"publisher","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"John Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 286\u2013295 (1951)","journal-title":"The Annals of Mathematics"},{"key":"44_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-319-07956-1_25","volume-title":"Algorithmic Aspects in Information and Management","author":"E Roshanbin","year":"2014","unstructured":"Roshanbin, E.: The competitive diffusion game in classes of graphs. In: Gu, Q., Hell, P., Yang, B. (eds.) AAIM 2014. LNCS, vol. 8546, pp. 275\u2013287. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07956-1_25"},{"key":"44_CR15","doi-asserted-by":"crossref","unstructured":"Teramoto, S., Demaine, E. D., Uehara, R.: Voronoi game on graphs and its complexity. In: IEEE Symposium on Computational Intelligence and Games, pp. 265\u2013271. IEEE (2006)","DOI":"10.1109\/CIG.2006.311711"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-26176-4_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:14:42Z","timestamp":1709824482000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-26176-4_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030261757","9783030261764"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-26176-4_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictt.xidian.edu.cn\/COCOON2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}