{"id":"https://openalex.org/W2747628745","doi":"https://doi.org/10.1007/978-3-319-66700-3_5","title":"On the Nucleolus of Shortest Path Games","display_name":"On the Nucleolus of Shortest Path Games","publication_year":2017,"publication_date":"2017-01-01","ids":{"openalex":"https://openalex.org/W2747628745","doi":"https://doi.org/10.1007/978-3-319-66700-3_5","mag":"2747628745"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-66700-3_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-66700-3_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020748279","display_name":"Mourad Ba\u0131\u0308ou","orcid":"https://orcid.org/0000-0003-0735-7689"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210143836","display_name":"Clermont Universit\u00e9","ror":"https://ror.org/03yf5zr20","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210143836"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Mourad Ba\u00efou","raw_affiliation_strings":["CNRS and Universit\u00e9 Clermont II, Campus des C\u00e9zeaux BP 125, 63173, Aubi\u00e8re Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS and Universit\u00e9 Clermont II, Campus des C\u00e9zeaux BP 125, 63173, Aubi\u00e8re Cedex, France","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210143836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076877502","display_name":"Francisco Barahona","orcid":"https://orcid.org/0000-0002-4829-7515"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Francisco Barahona","raw_affiliation_strings":["IBM T.J. Watson Research Center, Yorktown Heights, NY, 10589, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, Yorktown Heights, NY, 10589, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076877502"],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":7.5645,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.96657474,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"55","last_page":"66"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8000969886779785},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6242678165435791},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47437983751296997},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3483731746673584},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3365912437438965},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09254226088523865},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.061345964670181274}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8000969886779785},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6242678165435791},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47437983751296997},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3483731746673584},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3365912437438965},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09254226088523865},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.061345964670181274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-319-66700-3_5","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-66700-3_5","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1609615991","https://openalex.org/W1900044096","https://openalex.org/W1977545325","https://openalex.org/W2029140075","https://openalex.org/W2042923780","https://openalex.org/W2048790997","https://openalex.org/W2064699170","https://openalex.org/W2074062423","https://openalex.org/W2094691341","https://openalex.org/W2115064460","https://openalex.org/W2125363721","https://openalex.org/W2146709340","https://openalex.org/W2162828214","https://openalex.org/W2492531120","https://openalex.org/W3137934641","https://openalex.org/W4230127733","https://openalex.org/W4285719527","https://openalex.org/W6700181353"],"related_works":["https://openalex.org/W2371125232","https://openalex.org/W2023505575","https://openalex.org/W2407353104","https://openalex.org/W1553630057","https://openalex.org/W2373437113","https://openalex.org/W2317449002","https://openalex.org/W3106476875","https://openalex.org/W2384974102","https://openalex.org/W2316925676","https://openalex.org/W1824534578"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2}],"updated_date":"2026-08-04T08:18:43.703281","created_date":"2025-10-10T00:00:00"}