Game theory

  • Thread starter blablabl
  • Start date
  • #1
blablabl
I would like to know which strategies survive iterative deletion of strictly dominated strategies

D E F
A 0, 1 0, 0 10, 4/5
B 3, 1 1, 2 0, 1
C 1, 5/2 2, 3/2 0, 2

Since there are only weakly dominated strategies, the answer is A, B, C and D, E, F. Is this correct?*
 

Answers and Replies

  • #2
Chronos
Science Advisor
Gold Member
11,429
745
That is a failed AI strategy, that a pattern based algorithm can find an infallible solution to any problem. Were that true we would already have infallible chess programs. We don't. Either there is no such algorithm, or, we are too dumb to figure it out.
 

Related Threads on Game theory

  • Last Post
Replies
2
Views
652
  • Last Post
Replies
2
Views
1K
Replies
9
Views
782
  • Last Post
2
Replies
46
Views
5K
  • Last Post
Replies
3
Views
3K
  • Last Post
Replies
21
Views
3K
Replies
5
Views
1K
Replies
3
Views
3K
Replies
9
Views
3K
Replies
21
Views
16K
Top