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.

  1. What is the bellman equation for this problem?
  2. What is the terminal condition for executing the value-iteration algorithm?
  3. Why solving this problem with this solution is better than the minimax approach?

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.