Nash equilibria in mixed stationary strategies for M-player cyclic games on networks
Închide
Articolul precedent
Articolul urmator
426 0
SM ISO690:2012
LOZOVANU, Dmitrii, PICKL, Stefan Wolfgang. Nash equilibria in mixed stationary strategies for M-player cyclic games on networks. In: Cologne-Twente Workshop on Graphs and Combinatorial Optimization: CTW 2018, 18-20 iunie 2018, Paris. Paris; France: University of Cologne, 2019, Ediția a 16-a, pp. 76-79. 10.1007/s10107-008-0235-8
EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core
Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Ediția a 16-a, 2019
Masa rotundă "16th Cologne-Twente Workshop on Graphs and Combinatorial Optimization"
Paris, Franța, 18-20 iunie 2018

Nash equilibria in mixed stationary strategies for M-player cyclic games on networks


Pag. 76-79

Lozovanu Dmitrii1, Pickl Stefan Wolfgang2
 
1 Vladimir Andrunachievici Institute of Mathematics and Computer Science,
2 Bundeswehr University Munich
 
 
Disponibil în IBN: 25 aprilie 2021


Rezumat

We consider non-zero cyclic games on networks with average payoffs and show that this class of games possesses Nash equilibria in mixed stationary strategies. An approach for determining the optimal strategies of the players in the considered games is proposed. 

Cuvinte-cheie
Average payoffs, Cyclic game, Mixed stationary strategy, Nash equilibrium

Cerif XML Export

<?xml version='1.0' encoding='utf-8'?>
<CERIF xmlns='urn:xmlns:org:eurocris:cerif-1.5-1' xsi:schemaLocation='urn:xmlns:org:eurocris:cerif-1.5-1 http://www.eurocris.org/Uploads/Web%20pages/CERIF-1.5/CERIF_1.5_1.xsd' xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' release='1.5' date='2012-10-07' sourceDatabase='Output Profile'>
<cfResPubl>
<cfResPublId>ibn-ResPubl-128316</cfResPublId>
<cfResPublDate>2019</cfResPublDate>
<cfVol>Ediția a 16-a</cfVol>
<cfStartPage>76</cfStartPage>
<cfISBN></cfISBN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/128316</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>Nash equilibria in mixed stationary strategies for M-player cyclic games on networks</cfTitle>
<cfKeyw cfLangCode='EN' cfTrans='o'>Average payoffs; Cyclic game; Mixed stationary strategy; Nash equilibrium</cfKeyw>
<cfAbstr cfLangCode='EN' cfTrans='o'><p>We consider non-zero cyclic games on networks with average payoffs and show that this class of games possesses Nash equilibria in mixed stationary strategies. An approach for determining the optimal strategies of the players in the considered games is proposed.&nbsp;</p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-129</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfPers_ResPubl>
<cfPersId>ibn-person-14970</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
</cfPers_ResPubl>
<cfFedId>
<cfFedIdId>ibn-doi-128316</cfFedIdId>
<cfFedId>10.1007/s10107-008-0235-8</cfFedId>
<cfStartDate>2019T24:00:00</cfStartDate>
<cfFedId_Class>
<cfClassId>31d222b4-11e0-434b-b5ae-088119c51189</cfClassId>
<cfClassSchemeId>bccb3266-689d-4740-a039-c96594b4d916</cfClassSchemeId>
</cfFedId_Class>
<cfFedId_Srv>
<cfSrvId>5123451</cfSrvId>
<cfClassId>eda2b2e2-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>5a270628-f593-4ff4-a44a-95660c76e182</cfClassSchemeId>
</cfFedId_Srv>
</cfFedId>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-129</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-129-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
<cfFamilyNames>Lozovanu</cfFamilyNames>
<cfFirstNames>Dmitrii</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfPers>
<cfPersId>ibn-Pers-14970</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-14970-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2019T24:00:00</cfStartDate>
<cfFamilyNames>Pickl</cfFamilyNames>
<cfFirstNames>Stefan Wolfgang</cfFirstNames>
</cfPersName_Pers>
</cfPers>
<cfSrv>
<cfSrvId>5123451</cfSrvId>
<cfName cfLangCode='en' cfTrans='o'>CrossRef DOI prefix service</cfName>
<cfDescr cfLangCode='en' cfTrans='o'>The service of issuing DOI prefixes to publishers</cfDescr>
<cfKeyw cfLangCode='en' cfTrans='o'>persistent identifier; Digital Object Identifier</cfKeyw>
</cfSrv>
</CERIF>