{"id":"https://openalex.org/W2184536951","doi":"https://doi.org/10.1007/978-3-662-44602-7_4","title":"The Shortest Path Game: Complexity and Algorithms","display_name":"The Shortest Path Game: Complexity and Algorithms","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2184536951","doi":"https://doi.org/10.1007/978-3-662-44602-7_4","mag":"2184536951"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-44602-7_4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-662-44602-7_4","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-662-44602-7_4.pdf","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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-662-44602-7_4.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007835513","display_name":"Andreas Darmann","orcid":"https://orcid.org/0000-0002-0477-4578"},"institutions":[{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":true,"raw_author_name":"Andreas Darmann","raw_affiliation_strings":["Institute of Public Economics, University of Graz, Universitaetsstr.\u00a015, 8010, Graz, Austria"],"affiliations":[{"raw_affiliation_string":"Institute of Public Economics, University of Graz, Universitaetsstr.\u00a015, 8010, Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069744603","display_name":"Ulrich Pferschy","orcid":"https://orcid.org/0000-0001-8881-1497"},"institutions":[{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Ulrich Pferschy","raw_affiliation_strings":["Department of Statistics and Operations Research, University of Graz, Universitaetsstr.\u00a015, 8010, Graz, Austria"],"affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Graz, Universitaetsstr.\u00a015, 8010, Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061614451","display_name":"Joachim Schauer","orcid":"https://orcid.org/0000-0002-2268-0612"},"institutions":[{"id":"https://openalex.org/I15766117","display_name":"University of Graz","ror":"https://ror.org/01faaaf77","country_code":"AT","type":"education","lineage":["https://openalex.org/I15766117"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Joachim Schauer","raw_affiliation_strings":["Department of Statistics and Operations Research, University of Graz, Universitaetsstr.\u00a015, 8010, Graz, Austria"],"affiliations":[{"raw_affiliation_string":"Department of Statistics and Operations Research, University of Graz, Universitaetsstr.\u00a015, 8010, Graz, Austria","institution_ids":["https://openalex.org/I15766117"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5007835513"],"corresponding_institution_ids":["https://openalex.org/I15766117"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":4.0346,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.93936567,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"39","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10991","display_name":"Game Theory and Voting Systems","score":0.9979000091552734,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9958999752998352,"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/game-tree","display_name":"Game tree","score":0.6118207573890686},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5917538404464722},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5484710931777954},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5300464630126953},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5060014128684998},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.45805585384368896},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4575376510620117},{"id":"https://openalex.org/keywords/combinatorial-game-theory","display_name":"Combinatorial game theory","score":0.4393066167831421},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.43166911602020264},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4297182261943817},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3899689018726349},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36528176069259644},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.337330162525177},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3136521279811859},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.2869333326816559},{"id":"https://openalex.org/keywords/sequential-game","display_name":"Sequential game","score":0.28429552912712097},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.10060307383537292}],"concepts":[{"id":"https://openalex.org/C95815963","wikidata":"https://www.wikidata.org/wiki/Q1377033","display_name":"Game tree","level":4,"score":0.6118207573890686},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5917538404464722},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5484710931777954},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5300464630126953},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5060014128684998},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.45805585384368896},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4575376510620117},{"id":"https://openalex.org/C102234262","wikidata":"https://www.wikidata.org/wiki/Q1320931","display_name":"Combinatorial game theory","level":4,"score":0.4393066167831421},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43166911602020264},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4297182261943817},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3899689018726349},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36528176069259644},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.337330162525177},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3136521279811859},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.2869333326816559},{"id":"https://openalex.org/C73795354","wikidata":"https://www.wikidata.org/wiki/Q287618","display_name":"Sequential game","level":3,"score":0.28429552912712097},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.10060307383537292}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-662-44602-7_4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-662-44602-7_4","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-662-44602-7_4.pdf","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"},{"id":"pmh:oai:HAL:hal-01402026v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01402026","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"8th IFIP International Conference on Theoretical Computer Science (TCS), Sep 2014, Rome, Italy. pp.39-53, ⟨10.1007/978-3-662-44602-7_4⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"doi:10.1007/978-3-662-44602-7_4","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-662-44602-7_4","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-662-44602-7_4.pdf","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"},"sustainable_development_goals":[{"score":0.800000011920929,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G51377059","display_name":null,"funder_award_id":"P 23724-G11","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"},{"id":"https://openalex.org/G793914656","display_name":null,"funder_award_id":"P 23829-N13","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"},{"id":"https://openalex.org/F4320325582","display_name":"Karl-Franzens-Universit\u00e4t Graz","ror":"https://ror.org/01faaaf77"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2184536951.pdf","grobid_xml":"https://content.openalex.org/works/W2184536951.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1689629105","https://openalex.org/W1868707354","https://openalex.org/W1991507217","https://openalex.org/W1998084650","https://openalex.org/W2008003941","https://openalex.org/W2042714866","https://openalex.org/W2046295942","https://openalex.org/W2077313418","https://openalex.org/W2156827107","https://openalex.org/W4211146495"],"related_works":["https://openalex.org/W4382866750","https://openalex.org/W4293167680","https://openalex.org/W2776102956","https://openalex.org/W4387185483","https://openalex.org/W2022506245","https://openalex.org/W2040572217","https://openalex.org/W2388410942","https://openalex.org/W4385965963","https://openalex.org/W2600678155","https://openalex.org/W2018146256"],"abstract_inverted_index":{"In":[0],"this":[1],"work":[2],"we":[3,149],"address":[4],"a":[5,26,29,34,89,95,98,126,172,183],"game":[6,111,117],"theoretic":[7],"variant":[8],"of":[9,25,63,113,142,174,185],"the":[10,23,61,64,71,84,110,114,136,139,143,146,164,175],"shortest":[11],"path":[12,72,127],"problem,":[13],"in":[14,42,44,54,88,109,118,163],"which":[15,47],"two":[16,38],"decision":[17],"makers":[18],"(agents/players)":[19],"move":[20],"together":[21],"along":[22],"edges":[24],"graph":[27,176],"from":[28],"given":[30,35],"starting":[31],"vertex":[32,46,56],"to":[33,49,59,69],"destination.":[36],"The":[37,52,167],"players":[39],"take":[40],"turns":[41],"deciding":[43],"each":[45,55,74],"edge":[48],"traverse":[50],"next.":[51],"decider":[53],"also":[57,83],"has":[58],"pay":[60],"cost":[62],"chosen":[65],"edge.":[66],"We":[67,121],"want":[68],"determine":[70],"where":[73],"player":[75,86],"minimizes":[76],"its":[77],"costs":[78],"taking":[79],"into":[80,177],"account":[81],"that":[82,123],"other":[85,147],"acts":[87],"selfish":[90],"and":[91,102,138,159,179],"rational":[92],"way.":[93],"Such":[94],"solution":[96],"is":[97,128,169],"subgame":[99],"perfect":[100],"equilibrium":[101],"can":[103,150],"be":[104],"determined":[105],"by":[106,182],"backward":[107],"induction":[108],"tree":[112],"associated":[115],"finite":[116],"extensive":[119],"form.":[120],"show":[122],"finding":[124],"such":[125],"PSPACE-complete":[129],"even":[130],"for":[131,135,155,160],"bipartite":[132],"graphs":[133,158,162],"both":[134],"directed":[137,156],"undirected":[140,165],"version":[141],"game.":[144],"On":[145],"hand,":[148],"give":[151],"polynomial":[152],"time":[153],"algorithms":[154],"acyclic":[157],"cactus":[161],"case.":[166],"latter":[168],"based":[170],"on":[171],"decomposition":[173],"components":[178],"their":[180],"resolution":[181],"number":[184],"fairly":[186],"involved":[187],"dynamic":[188],"programming":[189],"arrays.":[190]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":3}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}