Abstract
In this paper, we prove an approximation theorem for equilibrium problems and provide theoretical support for many algorithms. Simon's bounded rationality is illustrated by an approximation theorem, that is, bounded rationality is approaching full rationality as its ultimate goal. Furthermore, by the methods of set-valued analysis, we obtain the generic uniqueness and generic convergence of the solutions of monotone equilibrium problems in the sense of Baire category. As applications, we investigate the optimization problem, variational inequality problem and saddle point problem as special cases.