Suppose that we have formulate a zero sum game with MDP and Ua(s) and Ub(s) are the utilities of A and B in the s state.
Suppose that all rewards and utilities are calculated from the A's point of view.
- What is the bellman equation for this problem?
- What is the terminal condition for executing the value-iteration algorithm?
- Why solving this problem with this solution is better than the minimax approach?