{"id":"https://openalex.org/W1983094524","doi":"https://doi.org/10.1109/cdc.2013.6759942","title":"Analysis of best-reply strategies in repeated finite Markov chains games","display_name":"Analysis of best-reply strategies in repeated finite Markov chains games","publication_year":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W1983094524","doi":"https://doi.org/10.1109/cdc.2013.6759942","mag":"1983094524"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2013.6759942","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2013.6759942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"52nd IEEE Conference on Decision and Control","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053505976","display_name":"Julio B. Clempner","orcid":"https://orcid.org/0000-0002-5918-4671"},"institutions":[{"id":"https://openalex.org/I4210090124","display_name":"Tecnol\u00f3gico Nacional de M\u00e9xico","ror":"https://ror.org/00davry38","country_code":"MX","type":"government","lineage":["https://openalex.org/I1302736544","https://openalex.org/I4210090124","https://openalex.org/I4405258672"]},{"id":"https://openalex.org/I59361560","display_name":"Instituto Polit\u00e9cnico Nacional","ror":"https://ror.org/059sp8j34","country_code":"MX","type":"education","lineage":["https://openalex.org/I59361560"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Julio Clempner","raw_affiliation_strings":["High School of Physics and Mathematics of National Polytechnic Institute (IPN), Mexico D.F","High Sch. of Phys. & Math., Nat. Polytech. Inst. (IPN), Mexico City, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"High School of Physics and Mathematics of National Polytechnic Institute (IPN), Mexico D.F","institution_ids":["https://openalex.org/I59361560"]},{"raw_affiliation_string":"High Sch. of Phys. & Math., Nat. Polytech. Inst. (IPN), Mexico City, Mexico","institution_ids":["https://openalex.org/I4210090124","https://openalex.org/I59361560"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015067771","display_name":"Alexander S. Poznyak","orcid":"https://orcid.org/0000-0002-5378-4545"},"institutions":[{"id":"https://openalex.org/I68368234","display_name":"Centro de Investigaci\u00f3n y de Estudios Avanzados del Instituto Polit\u00e9cnico Nacional","ror":"https://ror.org/009eqmr18","country_code":"MX","type":"facility","lineage":["https://openalex.org/I59361560","https://openalex.org/I68368234"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Alexander Poznyak","raw_affiliation_strings":["Automatic Control Department, CINVESTA, Mexico D.F","Autom. Control Dept., CINVESTA, Mexico City, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Automatic Control Department, CINVESTA, Mexico D.F","institution_ids":["https://openalex.org/I68368234"]},{"raw_affiliation_string":"Autom. Control Dept., CINVESTA, Mexico City, Mexico","institution_ids":["https://openalex.org/I68368234"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.292,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.94483516,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"32","issue":null,"first_page":"568","last_page":"573"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9997000098228455,"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/T12288","display_name":"Optimization and Search Problems","score":0.9926999807357788,"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"}},{"id":"https://openalex.org/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9887999892234802,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.7867162823677063},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5832394957542419},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.47645998001098633},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.44000935554504395},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34982138872146606},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28615620732307434},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.16995945572853088},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1490517556667328}],"concepts":[{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.7867162823677063},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5832394957542419},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.47645998001098633},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.44000935554504395},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34982138872146606},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28615620732307434},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.16995945572853088},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1490517556667328}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2013.6759942","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2013.6759942","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"52nd IEEE Conference on Decision and Control","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1500428599","https://openalex.org/W1599444075","https://openalex.org/W1972942694","https://openalex.org/W2010654234","https://openalex.org/W2022024689","https://openalex.org/W2140790422"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2379651310","https://openalex.org/W2113019827","https://openalex.org/W1541249122","https://openalex.org/W2413828414","https://openalex.org/W2367222340"],"abstract_inverted_index":{"The":[0,136],"\u201cbest-reply":[1],"strategy\u201d":[2],"is":[3,55,72,105,113,139],"a":[4,19,56,69],"natural":[5],"and":[6,58],"most":[7],"commonly":[8],"applied":[9],"type":[10],"of":[11,25,84,99,118],"actions":[12,94,150],"which":[13,112,129],"players":[14],"prefer":[15],"to":[16,36,43,51,68,97],"use":[17],"during":[18,133],"repeated":[20,64,143],"game.":[21,135],"Usually,":[22],"the":[23,41,45,66,81,91,108,116,134,142],"behavior":[24],"an":[26,119,125],"individual":[27,120,126],"cost-function,":[28],"when":[29],"such":[30,48],"strategies":[31,49],"are":[32],"applied,":[33],"turns":[34],"out":[35],"be":[37],"non-monotonic,":[38],"and,":[39],"as":[40],"results,":[42],"make":[44],"conclusion":[46,104],"that":[47,79],"lead":[50,95],"some":[52],"equilibrium":[53,71,101],"point":[54],"non-trivial":[57],"delicate":[59],"task.":[60],"Moreover,":[61],"even":[62],"in":[63,80],"games":[65],"convergence":[67],"stationary":[70],"not":[73],"always":[74],"guaranteed.":[75],"Here":[76],"we":[77],"show":[78],"ergodic":[82],"class":[83],"finite":[85],"controllable":[86],"Markov":[87],"Chains":[88],"Dynamic":[89],"Games":[90,110],"best":[92],"reply":[93],"obligatory":[96],"one":[98],"Nash":[100],"points.":[102],"This":[103],"done":[106],"by":[107,141],"Lyapunov":[109,121],"concept":[111],"based":[114],"on":[115],"designing":[117],"function":[122],"(related":[123],"with":[124,148],"cost":[127],"function)":[128],"monotonically":[130],"decreases":[131],"(non-increases)":[132],"suggested":[137],"approach":[138],"illustrated":[140],"asynchronous":[144],"\u201cPrisoner's":[145],"Dilemma\u201d":[146],"game":[147],"best-reply":[149],"application.":[151]},"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":3}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}