{"id":"https://openalex.org/W7169568309","doi":"https://doi.org/10.48550/arxiv.2607.14199","title":"Generalised Reachability Games","display_name":"Generalised Reachability Games","publication_year":2026,"publication_date":"2026-07-15","ids":{"openalex":"https://openalex.org/W7169568309","doi":"https://doi.org/10.48550/arxiv.2607.14199"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.14199","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.14199","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.14199","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004478118","display_name":"Sougata Bose","orcid":"https://orcid.org/0000-0003-3662-3915"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bose, Sougata","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5141093313","display_name":"Nathanael Fijalkow","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fijalkow, Nathanael","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068252968","display_name":"Daniel Hausmann","orcid":"https://orcid.org/0000-0002-0935-8602"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hausmann, Daniel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5141071535","display_name":"Florian Horn","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Horn, Florian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081071247","display_name":"Soumyajit Paul","orcid":"https://orcid.org/0000-0002-7233-2018"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Paul, Soumyajit","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041836791","display_name":"Sven Schewe","orcid":"https://orcid.org/0000-0002-9093-9518"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Schewe, Sven","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5004101656","display_name":"Tansholpan Zhanabekova","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhanabekova, Tansholpan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.3034000098705292,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.3034000098705292,"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"}},{"id":"https://openalex.org/T11574","display_name":"Artificial Intelligence in Games","score":0.25459998846054077,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.09920000284910202,"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/reachability","display_name":"Reachability","score":0.9581000208854675},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5983999967575073},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5782999992370605},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5636000037193298},{"id":"https://openalex.org/keywords/singleton","display_name":"Singleton","score":0.5291000008583069},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5224000215530396},{"id":"https://openalex.org/keywords/subspace-topology","display_name":"Subspace topology","score":0.4499000012874603},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41909998655319214}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9581000208854675},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5983999967575073},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5782999992370605},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5636000037193298},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5396000146865845},{"id":"https://openalex.org/C117354338","wikidata":"https://www.wikidata.org/wiki/Q1165112","display_name":"Singleton","level":3,"score":0.5291000008583069},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5224000215530396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4796000123023987},{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.4499000012874603},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41909998655319214},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4018000066280365},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39719998836517334},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39469999074935913},{"id":"https://openalex.org/C2780643141","wikidata":"https://www.wikidata.org/wiki/Q819049","display_name":"Pledge","level":2,"score":0.3440000116825104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3203999996185303},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.314300000667572},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3001999855041504},{"id":"https://openalex.org/C2776502983","wikidata":"https://www.wikidata.org/wiki/Q690182","display_name":"Contrast (vision)","level":2,"score":0.28999999165534973},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.27390000224113464},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25999999046325684}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.14199","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.14199","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.14199","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.14199","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,77,113,185],"study":[1,78,93,187],"two-player":[2,86],"zero-sum":[3],"turn-based":[4],"games":[5,20,87,122],"played":[6],"on":[7,179],"graphs":[8],"with":[9,57,88,216],"multiple":[10],"reachability":[11,15,19,49,90,212],"objectives":[12],"called":[13],"generalised":[14,48,89,211],"games.":[16,192],"In":[17,47],"classic":[18],"the":[21,39,51,64,79,83,101,107,110,118,126,133,148,153,166,180,194,208,214,220,230],"goal":[22],"of":[23,34,38,60,66,72,81,103,109,135,155,158,182,190,210,232,239,260],"one":[24],"player,":[25,41],"Eve,":[26],"is":[27,43,55,68,106,123,139,150,223,252],"to":[28,44,69,207,228,254,267],"visit":[29,70],"a":[30,58,246,256],"given":[31],"target":[32,53,61,111,137,156,218,233,261],"set":[33,54,138],"vertices,":[35],"and":[36,63,125,172,176],"that":[37,95,99,116,147,235,263],"other":[40],"Adam,":[42],"prevent":[45],"this.":[46],"games,":[50],"single":[52],"replaced":[56],"family":[59],"sets":[62,157,234,262],"objective":[65],"Eve":[67,226,251],"all":[71],"them":[73],"in":[74,85,120,152,205,213,245],"any":[75],"order.":[76],"complexity":[80,102],"deciding":[82,117],"winner":[84,119],"objectives.":[91],"Our":[92],"reveals":[94],"an":[96],"important":[97],"parameter":[98],"determines":[100],"this":[104,240],"problem":[105,149,222],"size":[108,134,159],"sets.":[112],"first":[114],"prove":[115],"such":[121],"PSPACE-complete,":[124],"PSPACE":[127],"lower":[128,177],"bound":[129],"holds":[130],"even":[131],"when":[132,225],"each":[136],"at":[140],"most":[141,201],"three.":[142],"By":[143],"contrast,":[144],"we":[145,164,197],"show":[146,198],"FPT":[151],"number":[154,231],"greater":[160],"than":[161],"one.":[162],"Moreover,":[163],"consider":[165],"memory":[167],"requirements":[168],"for":[169,200],"both":[170],"players":[171],"give":[173],"matching":[174],"upper":[175],"bounds":[178],"sizes":[181],"winning":[183],"strategies.":[184],"also":[186],"optimisation":[188,195,221,248],"variants":[189],"these":[191],"For":[193],"problems,":[196],"intractability":[199],"interesting":[202],"cases.":[203],"Particularly,":[204],"contrast":[206],"tractability":[209],"case":[215,241],"singleton":[217],"sets,":[219],"coNP-hard":[224],"tries":[227],"maximise":[229],"are":[236],"visited.":[237],"Tractability":[238],"can":[242,265],"be":[243],"recovered":[244],"different":[247],"setting":[249],"where":[250],"required":[253],"pledge":[255],"maximum":[257],"sized":[258],"subset":[259],"she":[264],"guarantee":[266],"visit.":[268]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-18T00:00:00"}