Perhaps the most well-known equilibrium concept for games is the Nash equilibrium (NE) [1]}. A NE is a tuple of policies (one for each player) in which no player can improve by deviating to a different policy. Formally, a policy profile \(\pi \)  is a NE if it satisfies:
\(\max _{i \in \mathcal {P}} \max _{\pi ^\prime \in \Sigma _i} \;u_i(\pi ^\prime , \pi _{-i}) - u_i(\pi _i, \pi _{-i}) \le 0\) 
