{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:07:18Z","timestamp":1742958438009,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031489730"},{"type":"electronic","value":"9783031489747"}],"license":[{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,31]],"date-time":"2023-12-31T00:00:00Z","timestamp":1703980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-48974-7_14","type":"book-chapter","created":{"date-parts":[[2023,12,30]],"date-time":"2023-12-30T18:01:32Z","timestamp":1703959292000},"page":"242-255","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Equilibrium Analysis of\u00a0Customer Attraction Games"],"prefix":"10.1007","author":[{"given":"Xiaotie","family":"Deng","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ningyuan","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qi","family":"Qi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,31]]},"reference":[{"issue":"1\u20133","key":"14_CR1","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.tcs.2003.09.004","volume":"310","author":"HK Ahn","year":"2004","unstructured":"Ahn, H.K., Cheng, S.W., Cheong, O., Golin, M., Van Oostrum, R.: Competitive facility location: the Voronoi game. Theor. Comput. Sci. 310(1\u20133), 457\u2013467 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"14_CR2","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":"4","key":"14_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., 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":"14_CR4","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.tcs.2014.10.003","volume":"562","author":"S Bandyapadhyay","year":"2015","unstructured":"Bandyapadhyay, S., Banik, A., Das, S., Sarkar, H.: Voronoi game on graphs. Theor. Comput. Sci. 562, 270\u2013282 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-71924-5_5","volume-title":"Web and Internet Economics","author":"O Ben-Porat","year":"2017","unstructured":"Ben-Porat, O., Tennenholtz, M.: Shapley facility location games. In: Devanur, N.R., Lu, P. (eds.) WINE 2017. LNCS, vol. 10660, pp. 58\u201373. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71924-5_5"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.tcs.2022.10.043","volume":"940","author":"V Bil\u00f2","year":"2023","unstructured":"Bil\u00f2, V., Gourv\u00e8s, L., Monnot, J.: Project games. Theor. Comput. Sci. 940, 97\u2013111 (2023)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Brenner, S.: Location (hotelling) games and applications. Wiley Encyclopedia of Operations Research and Management Science (2010)","DOI":"10.1002\/9780470400531.eorms0477"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Chawla, S., Niu, F.: The price of anarchy in Bertrand games. In: Proceedings of the 10th ACM conference on Electronic Commerce, pp. 305\u2013314 (2009)","DOI":"10.1145\/1566374.1566418"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-030-64946-3_22","volume-title":"Web and Internet Economics","author":"C Chen","year":"2020","unstructured":"Chen, C., Giessler, P., Mamageishvili, A., Mihal\u00e1k, M., Penna, P.: Sequential solutions in machine scheduling games. In: Chen, X., Gravin, N., Hoefer, M., Mehta, R. (eds.) WINE 2020. LNCS, vol. 12495, pp. 309\u2013322. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64946-3_22"},{"issue":"2","key":"14_CR10","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1007\/s00224-008-9128-8","volume":"45","author":"HL 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":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11561071_8","volume-title":"Algorithms \u2013 ESA 2005","author":"G Christodoulou","year":"2005","unstructured":"Christodoulou, G., Koutsoupias, E.: On the price of anarchy and stability of correlated equilibria of linear congestion games. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 59\u201370. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561071_8"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-030-35389-6_9","volume-title":"Web and Internet Economics","author":"A Cohen","year":"2019","unstructured":"Cohen, A., Peleg, D.: Hotelling games with random tolerance intervals. In: Caragiannis, I., Mirrokni, V., Nikolova, E. (eds.) WINE 2019. LNCS, vol. 11920, pp. 114\u2013128. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-35389-6_9"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"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 (TALG) 3(1), 1\u201317 (2007)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"14_CR14","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":"2","key":"14_CR15","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1086\/257897","volume":"65","author":"A Downs","year":"1957","unstructured":"Downs, A.: An economic theory of political action in a democracy. J. Polit. Econ. 65(2), 135\u2013150 (1957)","journal-title":"J. Polit. Econ."},{"key":"14_CR16","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":"14_CR17","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-1-4419-7572-0_7","volume-title":"Foundations of Location Analysis","author":"HA Eiselt","year":"2011","unstructured":"Eiselt, H.A.: Equilibria in competitive location models. In: Eiselt, H.A., Marianov, V. (eds.) Foundations of Location Analysis. ISORMS, vol. 155, pp. 139\u2013162. Springer, New York (2011). https:\/\/doi.org\/10.1007\/978-1-4419-7572-0_7"},{"issue":"1","key":"14_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/trsc.27.1.44","volume":"27","author":"HA Eiselt","year":"1993","unstructured":"Eiselt, H.A., Laporte, G., Thisse, J.F.: Competitive location models: a framework and bibliography. Transp. Sci. 27(1), 44\u201354 (1993)","journal-title":"Transp. Sci."},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Feldman, M., Fiat, A., Obraztsova, S.: Variations on the hotelling-downs model. In: Thirtieth AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1609\/aaai.v30i1.10054"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-10841-9_18","volume-title":"Internet and Network Economics","author":"M Gairing","year":"2009","unstructured":"Gairing, M.: Covering games: approximation through non-cooperation. In: Leonardi, S. (ed.) WINE 2009. LNCS, vol. 5929, pp. 184\u2013195. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10841-9_18"},{"issue":"2","key":"14_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3391434","volume":"8","author":"M Gairing","year":"2020","unstructured":"Gairing, M., Kollias, K., Kotsialou, G.: Existence and efficiency of equilibria for cost-sharing in generalized weighted congestion games. ACM Trans. Econ. Comput. (TEAC) 8(2), 1\u201328 (2020)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Goemans, M., Li, L.E., Mirrokni, V.S., Thottan, M.: Market sharing games applied to content distribution in ad-hoc networks. In: Proceedings of the 5th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 55\u201366 (2004)","DOI":"10.1145\/989459.989467"},{"issue":"3","key":"14_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":"153","key":"14_CR24","doi-asserted-by":"publisher","first-page":"41","DOI":"10.2307\/2224214","volume":"39","author":"H Hotelling","year":"1929","unstructured":"Hotelling, H.: Stability in competition. Econ. J. 39(153), 41\u201357 (1929)","journal-title":"Econ. J."},{"issue":"3","key":"14_CR25","first-page":"2109","volume":"31","author":"Z Huang","year":"2011","unstructured":"Huang, Z.: The mixed strategy equilibrium of the three-firm location game with discrete location choices. Econ. Bull. 31(3), 2109\u20132116 (2011)","journal-title":"Econ. Bull."},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1051\/proc\/202171163","volume":"71","author":"T Iimura","year":"2021","unstructured":"Iimura, T., von Mouche, P.: Discrete hotelling pure location games: potentials and equilibria. ESAIM Proc. Surv. 71, 163 (2021)","journal-title":"ESAIM Proc. Surv."},{"issue":"4","key":"14_CR27","doi-asserted-by":"publisher","first-page":"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. (TEAC) 3(4), 1\u201324 (2015)","journal-title":"ACM Trans. Econ. Comput. (TEAC)"},{"key":"14_CR28","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":"14_CR29","doi-asserted-by":"crossref","unstructured":"Krogmann, S., Lenzner, P., Molitor, L., Skopalik, A.: Two-stage facility location games with strategic clients and facilities. arXiv preprint arXiv:2105.01425 (2021)","DOI":"10.24963\/ijcai.2021\/41"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Krogmann, S., Lenzner, P., Skopalik, A.: Strategic facility location with clients that minimize total waiting time. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 37, no. 5, pp. 5714\u20135721 (2023)","DOI":"10.1609\/aaai.v37i5.25709"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Leme, R.P., Syrgkanis, V., Tardos, \u00c9.: The curse of simultaneity. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pp. 60\u201367 (2012)","DOI":"10.1145\/2090236.2090242"},{"key":"14_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/978-3-540-85238-4_41","volume-title":"Mathematical Foundations of Computer Science 2008","author":"M Mavronicolas","year":"2008","unstructured":"Mavronicolas, M., Monien, B., Papadopoulou, V.G., Schoppmann, F.: Voronoi games on cycle graphs. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 503\u2013514. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85238-4_41"},{"issue":"1","key":"14_CR33","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(1), 124\u2013143 (1996)","journal-title":"Games Econ. Behav."},{"issue":"2","key":"14_CR34","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s40505-015-0068-6","volume":"4","author":"M N\u00fa\u00f1ez","year":"2016","unstructured":"N\u00fa\u00f1ez, M., Scarsini, M.: Competing over a finite number of locations. Econ. Theory Bull. 4(2), 125\u2013136 (2016)","journal-title":"Econ. Theory Bull."},{"issue":"1","key":"14_CR35","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":"2","key":"14_CR36","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/506147.506153","volume":"49","author":"T Roughgarden","year":"2002","unstructured":"Roughgarden, T., Tardos, \u00c9.: How bad is selfish routing? J. ACM (JACM) 49(2), 236\u2013259 (2002)","journal-title":"J. ACM (JACM)"},{"key":"14_CR37","unstructured":"Shen, W., Wang, Z.: Hotelling-downs model with limited attraction. In: Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, pp. 660\u2013668 (2017)"},{"key":"14_CR38","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF01969077","volume":"7","author":"BH Stevens","year":"1961","unstructured":"Stevens, B.H.: An application of game theory to a problem in location strategy. Pap. Reg. Sci. Assoc. 7, 143\u2013157 (1961). https:\/\/doi.org\/10.1007\/BF01969077","journal-title":"Pap. Reg. Sci. Assoc."},{"key":"14_CR39","doi-asserted-by":"crossref","unstructured":"Vetta, A.: Nash equilibria in competitive societies, with applications to facility location, traffic routing and auctions. In: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pp. 416\u2013425. IEEE (2002)","DOI":"10.1109\/SFCS.2002.1181966"}],"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-031-48974-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T03:49:13Z","timestamp":1730951353000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48974-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,31]]},"ISBN":["9783031489730","9783031489747"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48974-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,31]]},"assertion":[{"value":"31 December 2023","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":"Shanghai","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wine2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/wine2023.shanghaitech.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"221","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":"37","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":"0","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":"17% - 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":"8","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29 one-page abstracts accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}