{"id":"https://openalex.org/W7160887429","doi":"https://doi.org/10.48550/arxiv.2605.10169","title":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","display_name":"Automated Approach for Solving Infinite-state Polynomial Reachability Games","publication_year":2026,"publication_date":"2026-05-11","ids":{"openalex":"https://openalex.org/W7160887429","doi":"https://doi.org/10.48550/arxiv.2605.10169"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.10169","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10169","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2605.10169","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136001009","display_name":"Krishnendu Chatterjee","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chatterjee, Krishnendu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015265503","display_name":"Ehsan Kafshdar Goharshady","orcid":"https://orcid.org/0000-0002-8595-0587"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Goharshady, Ehsan Kafshdar","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5092489728","display_name":"Mehrdad Karrabi","orcid":"https://orcid.org/0009-0007-5253-9170"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Karrabi, Mehrdad","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114367943","display_name":"Maximilian Seeliger","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Seeliger, Maximilian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5041082080","display_name":"\u0110or\u0111e \u017dikeli\u0107","orcid":"https://orcid.org/0000-0002-4681-1699"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"\u017dikeli\u0107, \u0110or\u0111e","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.6628999710083008,"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.6628999710083008,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.11089999973773956,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.05739999935030937,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9416000247001648},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6740999817848206},{"id":"https://openalex.org/keywords/ranking","display_name":"Ranking (information retrieval)","score":0.54339998960495},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5315999984741211},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5001000165939331},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4796000123023987}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.9416000247001648},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6740999817848206},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6554999947547913},{"id":"https://openalex.org/C189430467","wikidata":"https://www.wikidata.org/wiki/Q7293293","display_name":"Ranking (information retrieval)","level":2,"score":0.54339998960495},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5315999984741211},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5001000165939331},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4796000123023987},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4738999903202057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3321000039577484},{"id":"https://openalex.org/C56694532","wikidata":"https://www.wikidata.org/wiki/Q4421045","display_name":"Turns, rounds and time-keeping systems in games","level":4,"score":0.3264999985694885},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.31060001254081726},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C102234262","wikidata":"https://www.wikidata.org/wiki/Q1320931","display_name":"Combinatorial game theory","level":4,"score":0.2816999852657318},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.272599995136261},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.2671000063419342}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.10169","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10169","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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.2605.10169","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10169","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":{"Reachability":[0,35],"games":[1,4,36,64],"are":[2,97,137,213],"two-player":[3],"played":[5],"on":[6,65],"a":[7,72,89,107,119,147,153,161,169],"graph,":[8],"where":[9,133],"the":[10,18,22,32,80,84,123,166,185,195,201,208,227],"objective":[11,23],"of":[12,24,48,71,75,82,86,168,187,200,203],"$\\texttt{REACH}$":[13,93,116,157],"player":[14,26,117,158],"is":[15,27,174],"to":[16,28,53,190,215],"reach":[17,202],"target":[19,33],"set":[20,74],"whereas":[21],"$\\texttt{SAFE}$":[25],"stay":[29],"away":[30],"from":[31,122,194],"set.":[34],"have":[37],"important":[38],"applications":[39,50],"in":[40,165,179],"artificial":[41],"intelligence":[42],"and":[43,46,87,109,135,145,177],"reactive":[44],"synthesis,":[45],"many":[47],"these":[49],"give":[51],"rise":[52],"infinite-state":[54,66],"reachability":[55,63,105,131],"games.":[56],"In":[57],"this":[58],"paper,":[59],"we":[60,100,128,212],"study":[61],"turn-based":[62],"graphs":[67],"defined":[68],"over":[69,142],"valuations":[70],"finite":[73],"real":[76,143],"variables.":[77],"We":[78],"consider":[79,129],"problem":[81],"determining":[83],"existence":[85],"computing":[88,152],"winning":[90,120,154,219],"strategy":[91,121,155,220],"for":[92,104,113,151,156,207,221,226],"player.":[94],"Our":[95,182],"contributions":[96],"twofold.":[98],"First,":[99],"propose":[101,146],"ranking":[102,170],"certificates":[103],"games,":[106,132],"sound":[108],"complete":[110],"proof":[111],"rule":[112],"proving":[114],"that":[115,197],"has":[118],"specified":[124],"initial":[125],"state.":[126],"Second,":[127],"polynomial":[130,140],"transitions":[134],"objectives":[136],"described":[138],"by":[139],"constraints":[141],"variables,":[144],"fully":[148],"automated":[149],"algorithm":[150,173],"together":[159],"with":[160],"formal":[162],"correctness":[163],"witness":[164],"form":[167],"certificate.":[171],"The":[172],"sound,":[175],"semi-complete,":[176],"runs":[178],"sub-exponential":[180],"time.":[181,229],"experiments":[183],"demonstrate":[184],"ability":[186],"our":[188],"method":[189],"solve":[191],"challenging":[192],"examples":[193],"literature":[196],"were":[198],"out":[199],"existing":[204],"methods.":[205],"Specifically,":[206],"classical":[209],"Cinderella-Stepmother":[210],"game,":[211],"able":[214],"compute":[216],"an":[217,222],"optimal":[218],"arbitrary":[223],"precision":[224],"parameter":[225],"first":[228]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-13T00:00:00"}