{"id":"https://openalex.org/W2973513530","doi":"https://doi.org/10.1080/01969722.2019.1656858","title":"Computing the Nash Bargaining Solution for Multiple Players in Discrete-Time Markov Chains Games","display_name":"Computing the Nash Bargaining Solution for Multiple Players in Discrete-Time Markov Chains Games","publication_year":2019,"publication_date":"2019-09-17","ids":{"openalex":"https://openalex.org/W2973513530","doi":"https://doi.org/10.1080/01969722.2019.1656858","mag":"2973513530"},"language":"en","primary_location":{"id":"doi:10.1080/01969722.2019.1656858","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01969722.2019.1656858","pdf_url":null,"source":{"id":"https://openalex.org/S117436046","display_name":"Cybernetics & Systems","issn_l":"0196-9722","issn":["0196-9722","1087-6553"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cybernetics and Systems","raw_type":"journal-article"},"type":"article","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/A5010816540","display_name":"Kristal K. Trejo","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kristal K. Trejo","raw_affiliation_strings":["Department of Automatic Control, Center for Research and Advanced Studies, Mexico City, Mexico;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Automatic Control, Center for Research and Advanced Studies, Mexico City, Mexico;","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053505976","display_name":"Julio B. Clempner","orcid":"https://orcid.org/0000-0002-5918-4671"},"institutions":[{"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 B. Clempner","raw_affiliation_strings":["Escuela Superior de F\u00edsica y Metem\u00e1ticas, Instituto Polit\u00e9cnico Nacional, School of Physics and Mathematics, National Polytechnic Institute, Mexico City, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Escuela Superior de F\u00edsica y Metem\u00e1ticas, Instituto Polit\u00e9cnico Nacional, School of Physics and Mathematics, National Polytechnic Institute, Mexico City, Mexico","institution_ids":["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":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alexander S. Poznyak","raw_affiliation_strings":["Department of Automatic Control, Center for Research and Advanced Studies, Mexico City, Mexico;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Automatic Control, Center for Research and Advanced Studies, Mexico City, Mexico;","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5010816540"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.12448414,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"51","issue":"1","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11031","display_name":"Game Theory and Applications","score":0.9912999868392944,"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/T11182","display_name":"Auction Theory and Applications","score":0.9785000085830688,"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/bargaining-problem","display_name":"Bargaining problem","score":0.7902547717094421},{"id":"https://openalex.org/keywords/nash-equilibrium","display_name":"Nash equilibrium","score":0.6699850559234619},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6014296412467957},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.5597951412200928},{"id":"https://openalex.org/keywords/epsilon-equilibrium","display_name":"Epsilon-equilibrium","score":0.5139793753623962},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.513470470905304},{"id":"https://openalex.org/keywords/stochastic-game","display_name":"Stochastic game","score":0.4880355894565582},{"id":"https://openalex.org/keywords/best-response","display_name":"Best response","score":0.4827670156955719},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.465422123670578},{"id":"https://openalex.org/keywords/game-theory","display_name":"Game theory","score":0.42335909605026245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.38530397415161133}],"concepts":[{"id":"https://openalex.org/C90376892","wikidata":"https://www.wikidata.org/wiki/Q1516247","display_name":"Bargaining problem","level":2,"score":0.7902547717094421},{"id":"https://openalex.org/C46814582","wikidata":"https://www.wikidata.org/wiki/Q23389","display_name":"Nash equilibrium","level":2,"score":0.6699850559234619},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6014296412467957},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.5597951412200928},{"id":"https://openalex.org/C141824439","wikidata":"https://www.wikidata.org/wiki/Q307521","display_name":"Epsilon-equilibrium","level":4,"score":0.5139793753623962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.513470470905304},{"id":"https://openalex.org/C22171661","wikidata":"https://www.wikidata.org/wiki/Q1074380","display_name":"Stochastic game","level":2,"score":0.4880355894565582},{"id":"https://openalex.org/C32407928","wikidata":"https://www.wikidata.org/wiki/Q2733833","display_name":"Best response","level":3,"score":0.4827670156955719},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.465422123670578},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.42335909605026245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38530397415161133},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/01969722.2019.1656858","is_oa":false,"landing_page_url":"https://doi.org/10.1080/01969722.2019.1656858","pdf_url":null,"source":{"id":"https://openalex.org/S117436046","display_name":"Cybernetics & Systems","issn_l":"0196-9722","issn":["0196-9722","1087-6553"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Cybernetics and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.44999998807907104}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W639492269","https://openalex.org/W1119482115","https://openalex.org/W1599444075","https://openalex.org/W1972681895","https://openalex.org/W1976370698","https://openalex.org/W1982845045","https://openalex.org/W1985978629","https://openalex.org/W2001910686","https://openalex.org/W2017990047","https://openalex.org/W2029247640","https://openalex.org/W2030148285","https://openalex.org/W2034223459","https://openalex.org/W2038614136","https://openalex.org/W2105321334","https://openalex.org/W2112374372","https://openalex.org/W2127425289","https://openalex.org/W2130128307","https://openalex.org/W2131431638","https://openalex.org/W2141230538","https://openalex.org/W2152547286","https://openalex.org/W2155294502","https://openalex.org/W2155931054","https://openalex.org/W2157543034","https://openalex.org/W2161792108","https://openalex.org/W2166911977","https://openalex.org/W2194966850","https://openalex.org/W2330024298","https://openalex.org/W2345924723","https://openalex.org/W2520006692","https://openalex.org/W2802627035","https://openalex.org/W2894168355","https://openalex.org/W4234761190","https://openalex.org/W6679595966","https://openalex.org/W7058714814"],"related_works":["https://openalex.org/W1853631319","https://openalex.org/W2092374696","https://openalex.org/W4315489088","https://openalex.org/W2013767790","https://openalex.org/W2481143976","https://openalex.org/W4301347782","https://openalex.org/W3125812435","https://openalex.org/W1667857601","https://openalex.org/W2803932348","https://openalex.org/W1976009178"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,105,109],"novel":[4],"method":[5,103],"for":[6,12,108],"computing":[7],"the":[8,22,28,32,36,41,47,55,65,70,73,81,87,94,101],"Nash":[9,33],"bargaining":[10,23,48,88,111],"equilibrium":[11,34,77],"finite,":[13],"ergodic":[14],"and":[15],"controllable":[16],"Markov":[17],"chains":[18],"games.":[19],"To":[20],"solve":[21],"process":[24],"we":[25,45,79,90,99],"first":[26],"set":[27],"disagreement":[29],"point":[30,44,78],"as":[31],"of":[35,60,72,93],"problem,":[37],"then":[38],"to":[39,75],"find":[40],"new":[42],"agreement":[43],"follow":[46],"model":[49],"presented":[50],"by":[51,104],"Nash.":[52],"We":[53],"exemplify":[54],"game":[56,74],"formulation":[57],"in":[58],"terms":[59],"nonlinear":[61],"programing":[62],"equations":[63],"implementing":[64],"Lagrange":[66],"principle.":[67],"For":[68,85],"ensuring":[69],"convergence":[71],"an":[76],"employ":[80],"Tikhonov\u2019s":[82],"regularization":[83],"method.":[84],"solving":[86],"problem":[89],"make":[91],"use":[92],"extraproximal":[95],"optimization":[96],"approach.":[97],"Finally,":[98],"validate":[100],"proposed":[102],"numerical":[106],"example":[107],"three-person":[110],"situation.":[112]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}