
#1
Oct2913, 08:37 AM

P: 1

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?* 



#2
Nov413, 12:11 AM

Sci Advisor
PF Gold
P: 9,178

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.



Register to reply 
Related Discussions  
Twoperson sequential game, game theory  Calculus & Beyond Homework  0  
Analyzing a game for fairness? (game theory question)  Set Theory, Logic, Probability, Statistics  6  
Game Theory ( 2 player zerosum game)  Calculus & Beyond Homework  1  
game theory and quantum game theory  Quantum Physics  1  
Help with game theory (specific knowledge in game theory probably not required)  Calculus & Beyond Homework  4 