Score contribution per author:
α: calibrated so average coauthorship-adjusted count equals average raw count
Global games are widely used to predict behaviour in games with strategic complementarities and multiple equilibria. We establish two results on the global game selection. First, we show that, for any supermodular complete information game, the global game selection is independent of the payoff functions chosen for the gameʼs global game embedding. Second, we give a simple sufficient criterion to derive the selection and establish noise independence in many-action games by decomposing them into games with smaller action sets, to which we may often apply simple criteria. We also report in which small games noise independence may be established by counting the number of players or actions.