.png){kind=icon}
返回
Computing Nash Equilibria in Bimatrix Games: GPU-Based Parallel Support Enumeration
.png){kind=icon}
PRE
AI
DOI：10.1109/TPDS.2014.2307887.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Computing Nash equilibria is a very important problem in strategic analysis of markets, conflicts, and resource allocation. Unfortunately, computing these equilibria even for moderately sized games is computationally expensive. To obtain lower execution times it is essential to exploit the parallel processing capabilities offered by the currently available massively parallel architectures. To address this issue, we design a GPU-based parallel support enumeration algorithm for computing Nash equilibria in bimatrix games. The algorithm is based on a new parallelization method which achieves high degrees of parallelism suitable for massively parallel GPU architectures. We perform extensive experiments to characterize the performance of the proposed algorithm. The algorithm achieves significant speedups relative to the OpenMP and MPI-based parallel implementations of the support enumeration method running on a cluster of multi-core computers.
Keyword:
Nash equilibria
game theory
parallel algorithms
GPU
OpenMP
MPI
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
5.2K
被引数:
1.1W
机构
引用论文
Low Precision Local Learning for Hardware-Friendly Neuromorphic Visual Recognition.png)
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)
ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)IF0
PREAI
分享收藏
查看更多内容