Methods of solving perfect informational games

Hancu Boris

Articolul precedent

Articolul urmator

294

Ultima descărcare din IBN:
2023-08-31 16:49

SM ISO690:2012

HANCU, Boris. Methods of solving perfect informational games. In: Conference on Applied and Industrial Mathematics: CAIM 2018, 20-22 septembrie 2018, Iași, România. Chișinău, Republica Moldova: Casa Editorial-Poligrafică „Bons Offices”, 2018, Ediţia a 26-a, p. 74. ISBN 978-9975-76-247-2.

EXPORT metadate:
Google Scholar
Crossref
CERIF

DataCite
Dublin Core

Conference on Applied and Industrial Mathematics
Ediţia a 26-a, 2018

Conferința "Conference on Applied and Industrial Mathematics"
Iași, România, Romania, 20-22 septembrie 2018

Methods of solving perfect informational games

Pag. 74-74

Hancu Boris

Moldova State University

Disponibil în IBN: 1 iunie 2022

Descarcă PDF

Rezumat

We consider a two persons game in complete and "1 2"-perfect information with the normal form Г = hX; Y;H1;H2i : The "1 2"-perfect information permits us to use other types of strategies, which represents "programs of action". We call these strategies "informationally extended strategies" and denote the sets of these strategies by 1 = f1 : Y ! X 8y 2 Y; 1(y) 2 Xg; 2 = f2 : X ! Y 8x 2 X; 2(x) 2 Y g: We shall remark the following ways to solve games in informationally extended strategies.

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-157769</cfResPublId>
<cfResPublDate>2018</cfResPublDate>
<cfVol>Ediţia a 26-a</cfVol>
<cfStartPage>74</cfStartPage>
<cfISBN> 978-9975-76-247-2</cfISBN>
<cfURI>https://ibn.idsi.md/ro/vizualizare_articol/157769</cfURI>
<cfTitle cfLangCode='EN' cfTrans='o'>Methods of solving perfect informational games</cfTitle>
<cfAbstr cfLangCode='EN' cfTrans='o'><p>We consider a two persons game in complete and &quot;1  2&quot;-perfect information with the normal form Г = hX; Y;H1;H2i : The &quot;1  2&quot;-perfect information permits us to use other types of strategies, which represents &quot;programs of action&quot;. We call these strategies &quot;informationally extended strategies&quot; and denote the sets of these strategies by 1 = f1 : Y ! X 8y 2 Y; 1(y) 2 Xg; 2 = f2 : X ! Y 8x 2 X; 2(x) 2 Y g: We shall remark the following ways to solve games in informationally extended strategies.</p></cfAbstr>
<cfResPubl_Class>
<cfClassId>eda2d9e9-34c5-11e1-b86c-0800200c9a66</cfClassId>
<cfClassSchemeId>759af938-34ae-11e1-b86c-0800200c9a66</cfClassSchemeId>
<cfStartDate>2018T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfResPubl_Class>
<cfClassId>e601872f-4b7e-4d88-929f-7df027b226c9</cfClassId>
<cfClassSchemeId>40e90e2f-446d-460a-98e5-5dce57550c48</cfClassSchemeId>
<cfStartDate>2018T24:00:00</cfStartDate>
</cfResPubl_Class>
<cfPers_ResPubl>
<cfPersId>ibn-person-10535</cfPersId>
<cfClassId>49815870-1cfe-11e1-8bc2-0800200c9a66</cfClassId>
<cfClassSchemeId>b7135ad0-1d00-11e1-8bc2-0800200c9a66</cfClassSchemeId>
<cfStartDate>2018T24:00:00</cfStartDate>
</cfPers_ResPubl>
</cfResPubl>
<cfPers>
<cfPersId>ibn-Pers-10535</cfPersId>
<cfPersName_Pers>
<cfPersNameId>ibn-PersName-10535-3</cfPersNameId>
<cfClassId>55f90543-d631-42eb-8d47-d8d9266cbb26</cfClassId>
<cfClassSchemeId>7375609d-cfa6-45ce-a803-75de69abe21f</cfClassSchemeId>
<cfStartDate>2018T24:00:00</cfStartDate>
<cfFamilyNames>Hancu</cfFamilyNames>
<cfFirstNames>Boris</cfFirstNames>
</cfPersName_Pers>
</cfPers>
</CERIF>