{"id":"https://openalex.org/W2338624349","doi":"https://doi.org/10.23638/lmcs-13(3:29)2017","title":"Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs","display_name":"Easy to Win, Hard to Master: Optimal Strategies in Parity Games with Costs","publication_year":2017,"publication_date":"2017-09-19","ids":{"openalex":"https://openalex.org/W2338624349","doi":"https://doi.org/10.23638/lmcs-13(3:29)2017","mag":"2338624349"},"language":"en","primary_location":{"id":"doi:10.23638/lmcs-13(3:29)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(3:29)2017","pdf_url":"https://lmcs.episciences.org/3938/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/3938/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047415159","display_name":"Alexander Weinert","orcid":"https://orcid.org/0000-0001-8143-246X"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Alexander Weinert","raw_affiliation_strings":["Reactive Systems Group , Saarland University , 66123 Saarbrcken , Germany"],"affiliations":[{"raw_affiliation_string":"Reactive Systems Group , Saarland University , 66123 Saarbrcken , Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5064596121","display_name":"Mart\u00edn Zimmermann","orcid":"https://orcid.org/0000-0002-8038-2453"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Martin Zimmermann","raw_affiliation_strings":["Reactive Systems Group , Saarland University , 66123 Saarbrcken , Germany"],"affiliations":[{"raw_affiliation_string":"Reactive Systems Group , Saarland University , 66123 Saarbrcken , Germany","institution_ids":["https://openalex.org/I91712215"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5047415159"],"corresponding_institution_ids":["https://openalex.org/I91712215"],"apc_list":null,"apc_paid":null,"fwci":0.237,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.52091789,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"Volume 13, Issue 3","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.9973999857902527,"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.9973999857902527,"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.9930999875068665,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9915000200271606,"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/unary-operation","display_name":"Unary operation","score":0.855269193649292},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.7330046892166138},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5485270619392395},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5131481289863586},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5002436637878418},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38807550072669983},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.330130934715271},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32751601934432983},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.29860541224479675},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2941593527793884}],"concepts":[{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.855269193649292},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.7330046892166138},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5485270619392395},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5131481289863586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5002436637878418},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38807550072669983},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.330130934715271},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32751601934432983},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29860541224479675},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2941593527793884},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.23638/lmcs-13(3:29)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(3:29)2017","pdf_url":"https://lmcs.episciences.org/3938/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1604.05543","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1604.05543","pdf_url":"https://arxiv.org/pdf/1604.05543","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1604.05543","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1604.05543","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.23638/lmcs-13(3:29)2017","is_oa":true,"landing_page_url":"https://doi.org/10.23638/lmcs-13(3:29)2017","pdf_url":"https://lmcs.episciences.org/3938/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2666306201","display_name":null,"funder_award_id":"ZI 1516/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G6052429835","display_name":null,"funder_award_id":"(DFG)","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"},{"id":"https://openalex.org/G7387270584","display_name":null,"funder_award_id":"1516/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2338624349.pdf","grobid_xml":"https://content.openalex.org/works/W2338624349.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1569998753","https://openalex.org/W1737156267","https://openalex.org/W1745991775","https://openalex.org/W1829083937","https://openalex.org/W1966723394","https://openalex.org/W1967039025","https://openalex.org/W2015287249","https://openalex.org/W2019700891","https://openalex.org/W2038226372","https://openalex.org/W2048780543","https://openalex.org/W2120360673","https://openalex.org/W2126702500","https://openalex.org/W2142133061","https://openalex.org/W2198629034","https://openalex.org/W3002839602"],"related_works":["https://openalex.org/W2888918612","https://openalex.org/W2166285859","https://openalex.org/W3148597776","https://openalex.org/W1538206641","https://openalex.org/W2025370853","https://openalex.org/W3211656382","https://openalex.org/W2060412688","https://openalex.org/W1972183506","https://openalex.org/W4235940179","https://openalex.org/W2035521462"],"abstract_inverted_index":{"The":[0,84],"winning":[1,60,113],"condition":[2],"of":[3,21,28,42,67,145,165],"a":[4,29,140],"parity":[5,37,68,104],"game":[6],"with":[7,70,106,152],"costs":[8,71,107],"requires":[9],"an":[10],"arbitrary,":[11],"but":[12],"fixed":[13],"bound":[14,128],"on":[15],"the":[16,25,48,65,80,119,122,126],"cost":[17],"incurred":[18],"between":[19,121],"occurrences":[20],"odd":[22],"colors":[23],"and":[24,53,55,89,97,102,125,142,167],"next":[26],"occurrence":[27],"larger":[30],"even":[31],"one.":[32],"Such":[33],"games":[34,38,69,105,151],"quantitatively":[35],"extend":[36],"while":[39],"retaining":[40],"most":[41],"their":[43],"attractive":[44],"properties,":[45],"i.e,":[46],"determining":[47],"winner":[49],"is":[50,92,109,129,157],"in":[51,95,131,163],"NP":[52],"co-NP":[54],"one":[56],"player":[57],"has":[58],"positional":[59],"strategies.":[61],"We":[62],"show":[63,117],"that":[64,118],"characteristics":[66],"are":[72],"vastly":[73],"different":[74],"when":[75],"asking":[76],"for":[77,138],"strategies":[78],"realizing":[79],"minimal":[81],"such":[82],"bound:":[83],"solution":[85],"problem":[86],"becomes":[87],"PSPACE-complete":[88],"exponential":[90],"memory":[91,123],"both":[93,139,162],"necessary":[94],"general":[96],"always":[98],"sufficient.":[99],"Thus,":[100],"solving":[101],"playing":[103,155],"optimally":[108,156],"harder":[110],"than":[111],"just":[112],"them.":[114],"Moreover,":[115,147],"we":[116,148],"tradeoff":[120],"size":[124],"realized":[127],"gradual":[130],"general.":[132],"All":[133],"these":[134],"results":[135],"hold":[136],"true":[137],"unary":[141],"binary":[143],"encoding":[144],"costs.":[146,153],"investigate":[149],"Streett":[150],"Here,":[154],"as":[158,160],"hard":[159],"winning,":[161],"terms":[164],"complexity":[166],"memory.":[168]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}