{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:42Z","timestamp":1759638042252,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319996592"},{"type":"electronic","value":"9783319996608"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-99660-8_17","type":"book-chapter","created":{"date-parts":[[2018,8,26]],"date-time":"2018-08-26T18:19:21Z","timestamp":1535307561000},"page":"189-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty"],"prefix":"10.1007","author":[{"given":"Xujin","family":"Chen","sequence":"first","affiliation":[]},{"given":"Xiaodong","family":"Hu","sequence":"additional","affiliation":[]},{"given":"Chenhao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,27]]},"reference":[{"issue":"1\u20132","key":"17_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10107-005-0686-0","volume":"107","author":"M Aghassi","year":"2006","unstructured":"Aghassi, M., Bertsimas, D.: Robust game theory. Math. Program. 107(1\u20132), 231\u2013273 (2006)","journal-title":"Math. Program."},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0167-6377(00)00025-0","volume":"27","author":"I Averbakh","year":"2000","unstructured":"Averbakh, I.: Minmax regret solutions for minimax optimization problems with uncertainty. Oper. Res. Lett. 27(2), 57\u201365 (2000)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","volume":"138","author":"I Averbakh","year":"2004","unstructured":"Averbakh, I., Lebedev, V.: Interval data minmax regret network optimization problems. Discret. Appl. Math. 138(3), 289\u2013301 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"17_CR4","doi-asserted-by":"publisher","first-page":"1173","DOI":"10.1109\/JSAC.2007.070811","volume":"25","author":"R Banner","year":"2007","unstructured":"Banner, R., Orda, A.: Bottleneck routing games in communication networks. IEEE J. Sel. Areas Commun. 25(6), 1173\u20131179 (2007)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Caragiannis, I., Galdi, C., Kaklamanis, C.: Network load games. In: International Symposium on Algorithms and Computation, pp. 809\u2013818 (2005)","DOI":"10.1007\/11602613_81"},{"issue":"2","key":"17_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J.E., Wyllie, J.C.: The directed subgraph homeomorphism problem. Theor. Comput. Sci. 10(2), 111\u2013121 (1980)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00182-012-0322-1","volume":"42","author":"T Harks","year":"2013","unstructured":"Harks, T., Klimm, M., M\u00f6hring, R.H.: Strong equilibria in games with the lexicographical improvement property. Int. J. Game Theory 42(2), 461\u2013482 (2013)","journal-title":"Int. J. Game Theory"},{"issue":"5","key":"17_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"A Kasperski","year":"2006","unstructured":"Kasperski, A., Zielinski, P.: An approximation algorithm for interval data minmax regret combinatorial optimization problems. Inf. Process. Lett. 97(5), 177\u2013180 (2006)","journal-title":"Inf. Process. Lett."},{"key":"17_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust Discrete Optimization and Its Applications","author":"P Kouvelis","year":"1997","unstructured":"Kouvelis, P., Gang, Y.: Robust Discrete Optimization and Its Applications. Kluwer Academic Publishers, Boston (1997)"},{"issue":"1","key":"17_CR10","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":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/trsc.1090.0292","volume":"44","author":"F Ord\u00f3\u00f1ez","year":"2010","unstructured":"Ord\u00f3\u00f1ez, F., Stier-Moses, N.E.: Wardrop equilibria with risk-averse users. Transp. Sci. 44(1), 63\u201386 (2010)","journal-title":"Transp. Sci."},{"issue":"1","key":"17_CR12","doi-asserted-by":"publisher","first-page":"5:1","DOI":"10.1145\/2930956","volume":"5","author":"G Piliouras","year":"2016","unstructured":"Piliouras, G., Nikolova, E., Shamma, J.S.: Risk sensitivity of price of anarchy under uncertainty. ACM Trans. Econ. Comput. 5(1), 5:1\u20135:27 (2016). Article no 5","journal-title":"ACM Trans. Econ. Comput."},{"issue":"253","key":"17_CR13","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/01621459.1951.10500768","volume":"46","author":"LJ Savage","year":"1951","unstructured":"Savage, L.J.: The theory of statistical decision. Publ. Am. Stat. Assoc. 46(253), 55\u201367 (1951)","journal-title":"Publ. Am. Stat. Assoc."},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1002\/net.21606","volume":"66","author":"TL Werth","year":"2015","unstructured":"Werth, T.L., Bttner, S., Krumke, S.O.: Robust bottleneck routing games. Networks 66(1), 57\u201366 (2015)","journal-title":"Networks"},{"issue":"3","key":"17_CR15","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1016\/S0377-2217(03)00373-4","volume":"158","author":"P Zielinski","year":"2004","unstructured":"Zielinski, P.: The computational complexity of the relative robust shortest path problem with interval data. Eur. J. Oper. Res. 158(3), 570\u2013576 (2004)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99660-8_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:41:39Z","timestamp":1709833299000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99660-8_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319996592","9783319996608"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99660-8_17","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":"27 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/aims.sjtu.edu.cn\/SAGT_2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}