{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:40:42Z","timestamp":1756464042373},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319519623"},{"type":"electronic","value":"9783319519630"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-51963-0_14","type":"book-chapter","created":{"date-parts":[[2017,1,10]],"date-time":"2017-01-10T06:17:39Z","timestamp":1484029059000},"page":"176-187","source":"Crossref","is-referenced-by-count":2,"title":["Selfish Transportation Games"],"prefix":"10.1007","author":[{"given":"Dimitris","family":"Fotakis","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Gourv\u00e8s","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,11]]},"reference":[{"doi-asserted-by":"crossref","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. In: 45th Symposium on Foundations of Computer Science (FOCS 2004), 17\u201319 , Rome, Italy, Proceedings, pp. 295\u2013304. IEEE Computer Society, October 2004","key":"14_CR1","DOI":"10.1109\/FOCS.2004.68"},{"key":"14_CR2","series-title":"Princeton Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics. Princeton University Press, Princeton (2007)"},{"doi-asserted-by":"crossref","unstructured":"Aumann, R.J.: Acceptable points in general cooperative n-person games. In: Tucker, A.W., Luce, R.D. (eds.) Contribution to the Theory of Games. Annals of Mathematics Studies, 40 volume IV, pp. 287\u2013324. Princeton University Press (1959)","key":"14_CR3","DOI":"10.1515\/9781400882168-018"},{"unstructured":"Azar, Y., Jain, K., Mirrokni, V.S.: (Almost) optimal coordination mechanisms for unrelated machine scheduling. In: Shang-Hua Teng, (ed.) Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, San Francisco, California, USA, January 20\u201322, pp. 323\u2013332. SIAM (2008)","key":"14_CR4"},{"doi-asserted-by":"crossref","unstructured":"Bistaffa, F., Farinelli, A., Ramchurn, S.D.: Sharing rides with friends: a coalition formation algorithm for ridesharing. In: Bonet, B., Koenig, S. (eds.) Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25\u201330, Austin, Texas, USA, pp. 608\u2013614. AAAI Press (2015)","key":"14_CR5","DOI":"10.1609\/aaai.v29i1.9242"},{"issue":"2","key":"14_CR6","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02579075","volume":"9","author":"P Borm","year":"2001","unstructured":"Borm, P., Hamers, H., Hendrickx, R.: Operations research games: a survey. Top 9(2), 139\u2013199 (2001)","journal-title":"Top"},{"issue":"3","key":"14_CR7","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1007\/s00453-012-9650-6","volume":"66","author":"I Caragiannis","year":"2013","unstructured":"Caragiannis, I.: Efficient coordination mechanisms for unrelated machine scheduling. Algorithmica 66(3), 512\u2013540 (2013)","journal-title":"Algorithmica"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-0-387-30162-4_397","volume-title":"Encyclopedia of Algorithms","author":"K Cechl\u00e1rov\u00e1","year":"2008","unstructured":"Cechl\u00e1rov\u00e1, K.: Stable partition problem. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1\u201399. Springer, New York (2008). doi: 10.1007\/978-0-387-30162-4_397"},{"issue":"36","key":"14_CR9","doi-asserted-by":"crossref","first-page":"3327","DOI":"10.1016\/j.tcs.2009.01.005","volume":"410","author":"G Christodoulou","year":"2009","unstructured":"Christodoulou, G., Koutsoupias, E., Nanavati, A.: Coordination mechanisms. Theor. Comput. Sci. 410(36), 3327\u20133336 (2009)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Correa, J.R., Stier-Moses, N.E.: Wardrop equilibria. Wiley Encyclopedia of Operations Research and Management Science (2011)","key":"14_CR10","DOI":"10.1002\/9780470400531.eorms0962"},{"issue":"4","key":"14_CR11","doi-asserted-by":"crossref","first-page":"987","DOI":"10.2307\/1912943","volume":"48","author":"JH Dr\u00e8ze","year":"1980","unstructured":"Dr\u00e8ze, J.H., Greenberg, J.: Hedonic coalitions: optimality and stability. Econometrica 48(4), 987\u20131003 (1980)","journal-title":"Econometrica"},{"issue":"1","key":"14_CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1287\/trsc.1030.0035","volume":"38","author":"S Engevall","year":"2004","unstructured":"Engevall, S., Lundgren, M., V\u00e4rbrand, P.: The heterogeneous vehicle - routing game. Transp. Sci. 38(1), 71\u201385 (2004)","journal-title":"Transp. Sci."},{"issue":"3","key":"14_CR13","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.tcs.2002.12.001","volume":"313","author":"SP Fekete","year":"2004","unstructured":"Fekete, S.P., Fleischer, R., Fraenkel, A., Schmitt, M.: Traveling salesmen in the presence of competition. Theor. Comput. Sci. 313(3), 377\u2013392 (2004). Algorithmic Combinatorial Game Theory","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Feldman, M., Lewin-Eytan, L., Naor, J.: Hedonic clustering games. In: Blelloch, G.E., Herlihy, M. (eds.) 24th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2012, Pittsburgh, PA, USA, June 25\u201327, pp. 267\u2013276. ACM (2012)","key":"14_CR14","DOI":"10.1145\/2312005.2312053"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-16170-4_16","volume-title":"Algorithmic Game Theory","author":"M Gairing","year":"2010","unstructured":"Gairing, M., Savani, R.: Computing stable outcomes in hedonic games. In: Kontogiannis, S., Koutsoupias, E., Spirakis, P.G. (eds.) SAGT 2010. LNCS, vol. 6386, pp. 174\u2013185. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-16170-4_16"},{"unstructured":"Kamar, E., Horvitz, E.: Collaboration, shared plans in the open world: studies of ridesharing. In: Boutilier, C. (ed.) Proceedings of the 21st International Joint Conference on Artificial Intelligence, IJCAI, Pasadena, California, USA, July 11\u201317, p. 187 (2009)","key":"14_CR16"},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1057\/jors.2012.37","volume":"64","author":"G Kendall","year":"2013","unstructured":"Kendall, G., Li, J.: Competitive travelling salesmen problem: a hyper-heuristic approach. J. Oper. Res. Soc. 64, 208\u2013216 (2013)","journal-title":"J. Oper. Res. Soc."},{"unstructured":"Kleiner, A., Nebel, B., Ziparo, V.A.: A mechanism for dynamic ride sharing based on parallel auctions. In: Walsh, T. (ed.) Proceedings of the 22nd International Joint Conference on Artificial Intelligence, IJCAI, Barcelona, Catalonia, Spain, July 16\u201322, pp. 266\u2013272. IJCAI\/AAAI (2011)","key":"14_CR18"},{"key":"14_CR19","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). doi: 10.1007\/3-540-49116-3_38"},{"unstructured":"Lau, H.C., Agussurja, L., Cheng, S.-F., Tan, P.J.: A multi-objective memetic algorithm for vehicle resource allocation in sustainable transportation planning. In: Rossi, F. (ed.) Proceedings of the 23rd International Joint Conference on Artificial Intelligence, IJCAI, Beijing, China, August 3\u20139. IJCAI\/AAAI (2013)","key":"14_CR20"},{"issue":"2","key":"14_CR21","doi-asserted-by":"crossref","first-page":"286","DOI":"10.2307\/1969529","volume":"54","author":"J Nash","year":"1951","unstructured":"Nash, J.: Non-cooperative games. Ann. Math. 54(2), 286\u2013295 (1951)","journal-title":"Ann. Math."},{"volume-title":"The Vehicle Routing Problem","year":"2001","unstructured":"Toth, P., Vigo, D. (eds.): The Vehicle Routing Problem. Society for Industrial and Applied Mathematics, Philadelphia (2001)","key":"14_CR22"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2017: Theory and Practice of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51963-0_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,21]],"date-time":"2022-07-21T03:27:47Z","timestamp":1658374067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51963-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319519623","9783319519630"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51963-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}