A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Computing Nash Equilibria in Bimatrix Games: GPU-Based Parallel Support Enumeration
2014
IEEE Transactions on Parallel and Distributed Systems
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 faster execution times it is essential to exploit the available parallelism 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
doi:10.1109/tpds.2014.2307887
fatcat:gdyxywzwenchrok7jfbrtds4xq