Home Basic Game Theory for Automatic Verification
Post
Cancel

Basic Game Theory for Automatic Verification

Normal form game (NFG)

A (finite, $n$-person) normal form game is a tuple N = $(N, A, u)$, where:

  • $N = {1, …, n}$ is a finite set of players;
  • $A = A_1 \times…\times A_n$ and
This post is licensed under CC BY 4.0 by the author.