Constructive proof of the min-max theorem
From MaRDI portal
Cited in
(7)- A class of stochastic games with ordered field property
- The ordered field property and a finite algorithm for the Nash bargaining solution
- The fundamental theorem of game theory revisited
- Generalizations of the Nash equilibrium theorem in the KKM theory
- Seven kinds of computable and constructive infelicities in economics
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- Modelling the dynamics of learning continually with graph neural networks
This page was built for publication: Constructive proof of the min-max theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q768238)