{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:35:41Z","timestamp":1759667741450,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319666990"},{"type":"electronic","value":"9783319667003"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_5","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"55-66","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Nucleolus of Shortest Path Games"],"prefix":"10.1007","author":[{"given":"Mourad","family":"Ba\u00efou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francisco","family":"Barahona","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"key":"5_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice hall, Upper Saddle River (1993)"},{"key":"5_CR2","unstructured":"Aziz, H., S\u00f8rensen, T.B.: Path coalitional games, arXiv preprint arXiv:1103.3310 (2011)"},{"key":"5_CR3","volume-title":"Linear Programming","author":"V Chvatal","year":"1983","unstructured":"Chvatal, V.: Linear Programming. Macmillan, London (1983)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/s10878-008-9138-0","volume":"18","author":"X Deng","year":"2009","unstructured":"Deng, X., Fang, Q., Sun, X.: Finding nucleolus of flow game. J. Comb. Optim. 18, 64\u201386 (2009)","journal-title":"J. Comb. Optim."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Elkind, E., Pasechnik, D.: Computing the nucleolus of weighted voting games. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, pp. 327\u2013335 (2009)","DOI":"10.1137\/1.9781611973068.37"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s001820050083","volume":"27","author":"U Faigle","year":"1998","unstructured":"Faigle, U., Kern, W., Kuipers, J.: Note computing the nucleolus of min-cost spanning tree games is NP-hard. Int. J. Game Theory 27, 443\u2013450 (1998)","journal-title":"Int. J. Game Theory"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-319-21398-9_6","volume-title":"Computing and Combinatorics","author":"Q Fang","year":"2015","unstructured":"Fang, Q., Li, B., Shan, X., Sun, X.: The least-core and nucleolus of path cooperative games. In: Xu, D., Du, D., Du, D. (eds.) COCOON 2015. LNCS, vol. 9198, pp. 70\u201382. Springer, Cham (2015). doi:10.1007\/978-3-319-21398-9_6"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s001860000061","volume":"52","author":"V Fragnelli","year":"2000","unstructured":"Fragnelli, V., Garcia-Jurado, I., Mendez-Naya, L.: On shortest path games. Math. Methods Oper. Res. 52, 251\u2013264 (2000)","journal-title":"Math. Methods Oper. Res."},{"key":"5_CR9","first-page":"47","volume":"4","author":"DB Gillies","year":"1959","unstructured":"Gillies, D.B.: Solutions to general non-zero-sum games. Contrib. Theory Games 4, 47\u201385 (1959)","journal-title":"Contrib. Theory Games"},{"key":"5_CR10","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1145\/76359.76368","volume":"36","author":"AV Goldberg","year":"1989","unstructured":"Goldberg, A.V., Tarjan, R.E.: Finding minimum-cost circulations by canceling negative cycles. J. ACM (JACM) 36, 873\u2013886 (1989)","journal-title":"J. ACM (JACM)"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1002\/net.3230230607","volume":"23","author":"M Hartmann","year":"1993","unstructured":"Hartmann, M., Orlin, J.B.: Finding minimum cost to time ratio cycles with small integral transit times. Networks 23, 567\u2013574 (1993)","journal-title":"Networks"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1287\/opre.30.5.998","volume":"30","author":"E Kalai","year":"1982","unstructured":"Kalai, E., Zemel, E.: Generalized network problems yielding totally balanced games. Oper. Res. 30, 998\u20131008 (1982)","journal-title":"Oper. Res."},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1287\/moor.28.2.294.14477","volume":"28","author":"W Kern","year":"2003","unstructured":"Kern, W., Paulusma, D.: Matching games: the least core and the nucleolus. Math. Oper. Res. 28, 294\u2013308 (2003)","journal-title":"Math. Oper. Res."},{"key":"5_CR14","unstructured":"Kopelowitz, A.: Computation of the kernels of simple games and the nucleolus of n-person games. Technical report, DTIC Document (1967)"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1287\/moor.3.3.189","volume":"3","author":"N Megiddo","year":"1978","unstructured":"Megiddo, N.: Computational complexity of the game theory approach to cost allocation for a tree. Math. Oper. Res. 3, 189\u2013196 (1978)","journal-title":"Math. Oper. Res."},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/j.geb.2004.08.008","volume":"54","author":"J Potters","year":"2006","unstructured":"Potters, J., Reijnierse, H., Biswas, A.: The nucleolus of balanced simple flow networks. Games Econ. Behav. 54, 205\u2013225 (2006)","journal-title":"Games Econ. Behav."},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"1163","DOI":"10.1137\/0117107","volume":"17","author":"D Schmeidler","year":"1969","unstructured":"Schmeidler, D.: The nucleolus of a characteristic function game. SIAM J. Appl. Math. 17, 1163\u20131170 (1969)","journal-title":"SIAM J. Appl. Math."},{"key":"5_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01240179","volume":"23","author":"T Solymosi","year":"1994","unstructured":"Solymosi, T., Raghavan, T.E.: An algorithm for finding the nucleolus of assignment games. Int. J. Game Theory 23, 119\u2013143 (1994)","journal-title":"Int. J. Game Theory"}],"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-66700-3_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:25:55Z","timestamp":1709828755000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","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":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}