Data Parallelization for Solving Bimatrix Games [Articol]
| dc.contributor.author | Hâncu, Boris | ro |
| dc.contributor.author | Turcanu, Calin | en |
| dc.date.accessioned | 2025-07-09T06:06:57Z | |
| dc.date.issued | 2024 | |
| dc.description.abstract | Contemporary decision-making problems are very complex and require the processing of a very large volume of data. Thus, for the mathematical modelling of these processes, it is necessary to take into account the big data problems. The data is too big to be stored and processed by a single machine. In many large-scale solutions, data is divided into partitions that can be managed and accessed separately. In order to solve such problems in real time, parallel algorithms are built and then implemented on various types of parallel computing systems. In this paper, we will analyze the ways to build parallel algorithms, and especially, data parallelization, for a class of noncooperative games, bimatrix games. | en |
| dc.identifier.citation | HÂNCU, Boris and Calin TURCANU. Data Parallelization for Solving Bimatrix Games. In: International Conference dedicated to the 60th anniversary of the foundation of Vladimir Andrunachievici Institute of Mathematics and Computer Science, MSU, October 10-13 2024. Chisinau: [S. n.], 2024, pp. 434-437. ISBN 978-9975-68-515-3. | en |
| dc.identifier.isbn | 978-9975-68-515-3 | |
| dc.identifier.uri | https://msuir.usm.md/handle/123456789/18286 | |
| dc.language.iso | en | |
| dc.subject | bimatrix games | en |
| dc.subject | equilibrium profiles | en |
| dc.subject | HPC systems | en |
| dc.subject | parallel algorithms | en |
| dc.title | Data Parallelization for Solving Bimatrix Games [Articol] | en |
| dc.type | Article |