| Articolul precedent |
| Articolul urmator |
 |
 292 1 |
| Ultima descărcare din IBN: 2023-08-31 16:49 |
 SM ISO690:2012HANCU, 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 | ||||||
|
||||||
| Pag. 74-74 | ||||||
|
||||||
 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. |
||||||
|
|
|
|
