We introduce a variant of Milgrom and Weber’s (1985) model of $n$-person games with incomplete information (games for short) and define a correspondence that maps each game to its $\alpha$-core (the $\alpha$-core correspondences). Our main objective is to prove such a correspondence to be generically lower semicontinuous. For a multi-valued solution correspondence, the lower semicontinuity is relevant as a theoretical base for predicting outcomes using game-theoretic models. We introduce a family of games parametrized by both payoff functions and information structures (common priors), which allows simultaneous perturbations in those two parameters. We then appeal to Fort’s (1951) theorem to conclude that generic games are essential relative to the parameter space.

我们介绍了Milgrom和Weber（1985）模型的变体 $ñ$信息不完整的人机游戏（简称游戏），并定义将每个游戏映射到其对应关系的对应关系 $\alpha$核心（ $\alpha$核心信件）。我们的主要目的是证明这种对应关系通常是较低的半连续的。对于多值解决方案对应关系，较低的半连续性是使用博弈论模型预测结果的理论基础。我们介绍了一系列由回报功能和信息结构（共同的先验知识）参数化的游戏，它允许同时扰动这两个参数。然后，我们求助于Fort（1951）定理，得出结论：相对于参数空间，通用游戏至关重要。