On the approximation of upper semi-continuous correspondences and the equilibria of generalized games (Q1262228)

An approximating family for a correspondence is an indexed family of correspondences containing the original one and shrinking towards it. It is shown that correspondences with suitable regularity assumptions have approximating families, where each member is constructed from a fixed family of convex sets using partitions of unity. The result is used to give new proofs of the existence of equilibria in generalized games.