{"id":"https://openalex.org/W7165188542","doi":"https://doi.org/10.48550/arxiv.2606.19324","title":"Mean-Payoff-Parity and Lifting Strategies from MDPs to 2-Player Stochastic Games","display_name":"Mean-Payoff-Parity and Lifting Strategies from MDPs to 2-Player Stochastic Games","publication_year":2026,"publication_date":"2026-06-17","ids":{"openalex":"https://openalex.org/W7165188542","doi":"https://doi.org/10.48550/arxiv.2606.19324"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.19324","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.19324","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.2606.19324","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091467819","display_name":"Mohan Dantam","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dantam, Mohan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5135733044","display_name":"Richard Mayr","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mayr, Richard","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.48240000009536743,"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.48240000009536743,"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/T11031","display_name":"Game Theory and Applications","score":0.15929999947547913,"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.1143999993801117,"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/randomized-algorithm","display_name":"Randomized algorithm","score":0.505299985408783},{"id":"https://openalex.org/keywords/lift","display_name":"Lift (data mining)","score":0.47350001335144043},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4657999873161316},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.39590001106262207},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.30239999294281006},{"id":"https://openalex.org/keywords/stochastic-process","display_name":"Stochastic process","score":0.2793000042438507}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5730999708175659},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5289999842643738},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.505299985408783},{"id":"https://openalex.org/C139002025","wikidata":"https://www.wikidata.org/wiki/Q3001212","display_name":"Lift (data mining)","level":2,"score":0.47350001335144043},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4657999873161316},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.39590001106262207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3946000039577484},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.30239999294281006},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.271699994802475},{"id":"https://openalex.org/C127491075","wikidata":"https://www.wikidata.org/wiki/Q7617825","display_name":"Stochastic modelling","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.19324","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.19324","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.2606.19324","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.19324","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,48,164],"consider":[1],"the":[2,43,50,55,70,74,91,129],"strategy":[3,71],"complexity":[4,72],"(i.e.,":[5],"memory":[6,46,58,126,190],"and":[7,122,171],"randomization)":[8],"of":[9,45,73,131],"optimal":[10,25,101,106,116,175,183],"strategies":[11,27,108,118,147,178,186],"in":[12,19,42,61,78,113,179,191],"turn-based":[13],"2-player":[14,35,79,154,193],"zero-sum":[15],"stochastic":[16,36,80,114],"games.":[17,81,194],"Results":[18],"[Gimbert,Kelmendi:2023]":[20],"show":[21,49,136],"how":[22],"to":[23,34,128,153,160],"lift":[24],"memoryless":[26,102,143,161,176],"for":[28,64,94,141],"shift-invariant":[29,86,167],"inverse-submixing":[30],"objectives":[31],"from":[32,148],"MDPs":[33,149],"games":[37,155],"with":[38],"an":[39],"exponential":[40,57,110],"increase":[41],"number":[44,130],"modes.":[47],"corresponding":[51],"lower":[52],"bound,":[53],"i.e.,":[54],"extra":[56],"is":[59,84],"required":[60],"general,":[62],"even":[63,132,159],"randomized":[65,103,117,162,177],"strategies.":[66,163],"Moreover,":[67],"we":[68,135],"solve":[69],"well-studied":[75],"mean-payoff-parity":[76],"objective":[77,83,168],"This":[82],"also":[85],"inverse-submixing,":[87],"but":[88,182],"easier":[89],"than":[90],"worst":[92],"case":[93],"this":[95],"class.":[96],"In":[97],"MDPs,":[98,181],"Maximizer":[99],"has":[100],"strategies,":[104],"while":[105],"deterministic":[107,146,192],"require":[109,188],"memory.":[111],"However,":[112],"games,":[115],"require,":[119],"at":[120,123],"least":[121],"most,":[124],"linear":[125],"(equal":[127],"colors).":[133],"Finally,":[134],"that":[137],"a":[138,166],"different":[139],"construction":[140],"lifting":[142],"(resp.":[144,150],"finite-memory)":[145],"1-player":[151],"games)":[152],"cannot":[156],"be":[157],"generalized":[158],"construct":[165],"where":[169],"Max":[170,185],"Min":[172],"each":[173],"have":[174],"all":[180],"(randomized)":[184],"still":[187],"infinite":[189]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-19T00:00:00"}