Optimal strategic reasoning with McNaughton functions
We explore strategic two-player games with payoffs given by McNaughton functions. Sufficient conditions for the existence of finite Nash equilibria are provided. The algorithm for computing such equilibria is presented. The result directly generalizes to n-player strategic games.
mcnaughton function nash equilibria lukasiewicz logic infinite game