| Research Areas (all) | Publication Type | Years (all) |
|---|
|
| J | Journal Article |
| C | Conference Paper |
| B | Book |
| Ch | Book Chapter |
| T | Technical Report |
| PhD | PhD Disseration |
|
|
|
|
| topics: |
CGT | TCS |
|---|
|
1994
|
| C |
D. Koller, N. Megiddo, and B. von Stengel (1994). "Fast Algorithms for Finding Randomized Strategies in Game Trees." Proceedings of the 26th ACM Symposium on Theory of Computing (STOC '94) (pp. 750-759).
| bib/abs
|
| | topics: |
CGT |
TCS |
|
1992
|
| J |
D. Koller and N. Megiddo (1992). "The complexity of two-person zero-sum games in extensive form." Games and Economic Bahavior, 4(4), 528-552.
| bib/abs
|
| | topics: |
CGT |
TCS |
|
|
