Journal article 956 views 206 downloads
The Computational Complexity of Iterated Elimination of Dominated Strategies
Arno Pauly 
Theory of Computing Systems, Volume: 59, Issue: 1, Pages: 52 - 75
Swansea University Author:
Arno Pauly
-
PDF | Accepted Manuscript
Download (401.56KB)
DOI (Published version): 10.1007/s00224-015-9637-1
Abstract
The Computational Complexity of Iterated Elimination of Dominated Strategies
| Published in: | Theory of Computing Systems |
|---|---|
| ISSN: | 1432-4350 1433-0490 |
| Published: |
2016
|
| Online Access: |
Check full text
|
| URI: | https://cronfa.swan.ac.uk/Record/cronfa36018 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| College: |
Faculty of Science and Engineering |
|---|---|
| Issue: |
1 |
| Start Page: |
52 |
| End Page: |
75 |