Abstract :
A recursion principle, generalized iteration methods and the axiom of choice are applied to prove the existence of extremal fixed points of set-valued mappings in posets, extremal solutions of an inclusion problem, and extremal Nash equilibria for a normal-form game.
Keywords :
Order compact , Upper semi-closed , Fixed point , Poset , Inclusion problem , Minimal , Normal-form game , Inf-center , Sup-center , Maximal , Solution , Chain complete , Nash equilibrium , Set-valued mapping , Recursion principle , Generalized iteration methods
