---

tags:

• 🌱
• AI
• ComputerScience date: 17--Apr--2023

---

Deterministic policy for single-move game (single best action)

• Can be a single best action
• Set of strategy with best outcome for players are the same
  • The best choice in the set is then contingent to opponent's choice
  • Coordination problem
  • Focal point as resolution to the problem

• The actions unlike Mixed strategy is assigned with probability of 1/0
  • The action is either desired or avoided

---

Links: