The talk is divided into two parts. In the first, introductory part the (generalized) Nash equilibrium problem is presented and an overview of recent results related to their numerical solution is discussed. The second part is devoted to the study of (distributed) algorithms for the solution of the "Nash selection problem", extending and unifying several cases considered in the first part. Applications to a resource allocation problem in telecommunications will be presented.