Abstract:

In this paper, we study whether the approximate solution of bounded rationality converges to the exact solution of complete rationality, which provides a theoretical support for the algorithm of population games. Firstly, under certain assumptions, the approximation theorem of population games under bounded rationality is proved. Then, by using the method of set-valued analysis and in the sense of Baire classification, we obtain the result that the solution of population games with perturbations on the objective function has generic convergence.

Key words: Population games, Approximation theorem, Generic convergence, Bounded rationality