Nonatomic Games with Limited Anonymity

After a brief survey of the literature about the existence of a Nash Equilibrium in the class of the nonatomic games, we prove the existence of an equilibrium in the class of the nonatomic games where the players' payoff depends over the average strategy of finitely many convex and disjoint subsets of players. Finally, several applications are shown, in the context of the economics of science and namely about the problem of the topic choice made by the set of the researchers, represented as a continuum.