2. Articole

Permanent URI for this collectionhttps://msuir.usm.md/handle/123456789/17

Browse

Subject: search.filters.subject.Nash equilibrium

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    PARALLEL ALGORITHM TO SOLVING 2D BLOCK-CYCLIC PARTITIONED BIMATRIX GAMES
    (CEP USM, 2021) Hâncu, Boris; Cataranciuc, Emil
    The article presents a theoretical and practical study of the ways of determining solutions in bimatrix games divided into blocks of submatrices using 2D block-cyclic matrix dividing and distribution algorithm. The proved theorems represent the foundation on which the bimatrix game solution can be built using the sub-games solutions generated by the 2D-cyclic matrix distribution algorithm.
  • Thumbnail Image
    Item
    PARALLEL ALGORITHM TO FIND BAYES-NASH SOLUTION
    (Institutul de Matematică şi Informatică al Academiei de Ştiinţe a Moldovei, 2018) Hancu, Boris; Gladei, Anatolie
    We propose to use the new methodology for solving the com- plete and perfect information bimatrix game. To solve the ga- mes of these type we construct the incomplete and imperfect information game generated by the informational extended stra- tegies. Then we construct associated Bayesian game with non- informational extended strategies. For a HPC cluster computing system with shared and distributed memory, we constuct a paral- lel algorithm for computing Bayes-Nash solutions to the bimatrix informational extended games. The complexity and time perfor- mance analysis of the algorithm are provided.
  • Thumbnail Image
    Item
    DETERMINAREA MULŢIMII NASH ÎN JOCUL DIADIC ÎN STRATEGII MIXTE
    (CEP USM, 2014) Cîrnaț, Maria
    În acest articol este cercetată determinarea mulţimii de echilibre Nash pentru jocul diadic în strategii mixte, fiind studiate proprietăţile şi structura mulţimii Nash şi elaborat un algoritm de calcul simbolic în baza metodei de intersecţiea graficelor aplicaţiilor de răspuns optim [2,3]. Scopul principal al lucrării este de a simplifica esenţial algoritmul în baza căruia este alcătuit programul de calcul în sistemul Wolfram Mathematica 9, care vine ca o perfecţionare a celui publicat în 2007 pe Wolfram Demonstration Project [3]. Rezultatul principal ţine de reducerea senţială a numărului de cazuri cercetate la doar 38.