On the complexity of Nash equilibria of action-graph games
In light of much recent interest in finding a model of multi-player multi-action games that allows for efficient computation of Nash equilibria yet remains as expressive as possible, we investigate the computational complexity of Nash equilibria in the recently proposed model of action-graph games (...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Society for Industrial and Applied Mathematics,
2012-10-16T14:20:28Z.
|
| Subjects: | |
| Online Access: | Get fulltext |