{"id":"https://openalex.org/W4221163312","doi":"https://doi.org/10.46298/lmcs-19(1:16)2023","title":"Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs","display_name":"Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs","publication_year":2023,"publication_date":"2023-03-06","ids":{"openalex":"https://openalex.org/W4221163312","doi":"https://doi.org/10.46298/lmcs-19(1:16)2023"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-19(1:16)2023","is_oa":true,"landing_page_url":"http://dx.doi.org/10.46298/lmcs-19(1:16)2023","pdf_url":"https://lmcs.episciences.org/11029/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":"article","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/11029/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082358544","display_name":"Richard Mayr","orcid":"https://orcid.org/0009-0003-2164-9933"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Richard Mayr","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5082679805","display_name":"E. Munday","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Eric Munday","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082358544"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1758,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51768392,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"Volume 19, Issue 1","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.6093999743461609,"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"}},"topics":[{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.6093999743461609,"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/T10142","display_name":"Formal Methods in Verification","score":0.09350000321865082,"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.043699998408555984,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/stochastic-game","display_name":"Stochastic game","score":0.9247872829437256},{"id":"https://openalex.org/keywords/countable-set","display_name":"Countable set","score":0.7692234516143799},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.7083355188369751},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6263819932937622},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5566587448120117},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.47558677196502686},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.46025100350379944},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39742881059646606},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.3954038619995117},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34564581513404846},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33832067251205444},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11502858996391296}],"concepts":[{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.9247872829437256},{"id":"https://openalex.org/C110729354","wikidata":"https://www.wikidata.org/wiki/Q185478","display_name":"Countable set","level":2,"score":0.7692234516143799},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.7083355188369751},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6263819932937622},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5566587448120117},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.47558677196502686},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.46025100350379944},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39742881059646606},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.3954038619995117},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34564581513404846},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33832067251205444},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11502858996391296},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.46298/lmcs-19(1:16)2023","is_oa":true,"landing_page_url":"http://dx.doi.org/10.46298/lmcs-19(1:16)2023","pdf_url":"https://lmcs.episciences.org/11029/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:pure.ed.ac.uk:openaire/ef6fa3bd-e167-45b7-8de9-be5d6a87ed65","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/ef6fa3bd-e167-45b7-8de9-be5d6a87ed65","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mayr, R & Munday, E 2023, 'Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs', Logical Methods in Computer Science, vol. 19, no. 1, pp. 1-43. https://doi.org/10.46298/lmcs-19(1:16)2023","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:2203.07079","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2203.07079","pdf_url":"https://arxiv.org/pdf/2203.07079","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":"pmh:oai:pure.ed.ac.uk:publications/ef6fa3bd-e167-45b7-8de9-be5d6a87ed65","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/files/334527495/2203.07079_3_.pdf","pdf_url":"https://www.research.ed.ac.uk/en/publications/ef6fa3bd-e167-45b7-8de9-be5d6a87ed65","source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mayr, R & Munday, E 2023, 'Strategy Complexity of Point Payoff, Mean Payoff and Total Payoff Objectives in Countable MDPs', Logical Methods in Computer Science, vol. 19, no. 1, pp. 1-43. https://doi.org/10.46298/lmcs-19(1:16)2023","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:doaj.org/article:c3498cdb0a1b46118cbf1287b1225a10","is_oa":true,"landing_page_url":"https://doaj.org/article/c3498cdb0a1b46118cbf1287b1225a10","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 19, Issue 1 (2023)","raw_type":"article"},{"id":"doi:10.48550/arxiv.2203.07079","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2203.07079","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":"article-journal"}],"best_oa_location":{"id":"doi:10.46298/lmcs-19(1:16)2023","is_oa":true,"landing_page_url":"http://dx.doi.org/10.46298/lmcs-19(1:16)2023","pdf_url":"https://lmcs.episciences.org/11029/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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4221163312.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W6406787","https://openalex.org/W59012128","https://openalex.org/W51114640","https://openalex.org/W23084172","https://openalex.org/W60247044","https://openalex.org/W55995518","https://openalex.org/W16307307","https://openalex.org/W49602987","https://openalex.org/W78864476","https://openalex.org/W44302410"],"abstract_inverted_index":{"We":[0,80],"study":[1],"countably":[2],"infinite":[3,13],"Markov":[4],"decision":[5],"processes":[6],"(MDPs)":[7],"with":[8,110],"real-valued":[9],"transition":[10,29],"rewards.":[11],"Every":[12],"run":[14],"induces":[15],"the":[16,37,46,57,68,73,76,82,86],"following":[17],"sequences":[18],"of":[19,26,36,39,48,56,59,85,89],"payoffs:":[20],"1.":[21],"Point":[22],"payoff":[23,33,53,66],"(the":[24,34,54],"sequence":[25,35,55],"directly":[27],"seen":[28],"rewards),":[30],"2.":[31],"Mean":[32],"sums":[38,58],"all":[40,60],"rewards":[41,61],"so":[42,62],"far,":[43],"divided":[44],"by":[45],"number":[47],"steps),":[49],"and":[50,98],"3.":[51],"Total":[52],"far).":[63],"For":[64],"each":[65],"type,":[67],"objective":[69],"is":[70,78,96],"to":[71],"maximize":[72],"probability":[74],"that":[75],"$\\liminf$":[77],"non-negative.":[79],"establish":[81],"complete":[83],"picture":[84],"strategy":[87],"complexity":[88],"these":[90],"objectives,":[91],"i.e.,":[92],"how":[93],"much":[94],"memory":[95],"necessary":[97],"sufficient":[99],"for":[100],"$\\varepsilon$-optimal":[101],"(resp.":[102],"optimal)":[103],"strategies.":[104],"Some":[105],"cases":[106],"can":[107],"be":[108],"won":[109],"memoryless":[111],"deterministic":[112],"strategies,":[113],"while":[114],"others":[115],"require":[116],"a":[117,120],"step":[118],"counter,":[119,122],"reward":[121],"or":[123],"both.":[124]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2022-04-03T00:00:00"}