An Efficient Speedup Strategy for Constant Sum Game Computations
Large classes of game theoretic problems seem to defy attempts of finding polynomial-time al-gorithms while analyzing large amounts of data. This premise leads naturally to the possibility of using efficient parallel computing implementations when seeking exact solutions to some of these problems....
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Inforec Association
2014-01-01
|
| Series: | Informatică economică |
| Subjects: | |
| Online Access: | http://www.revistaie.ase.ro/content/72/13%20-%20Stan.pdf |