A classic model to study strategic decision making in multi-agent systems is the normal-form game. This model can be generalised to allow for an infinite number of pure strategies leading to continuous games. Multi-objective normal-form games are another generalisation that model settings where players receive separate payoffs in more than one objective. We bridge the gap between the two models by providing a theoretical guarantee that a game from one setting can always be transformed to a game in the other. We extend the theoretical results to include guaranteed equivalence of Nash equilibria. The mapping makes it relatively straightforward to apply algorithms from one field to the other. We demonstrate this by introducing a fictitious play algorithm for multi-objective games and subsequently applying it to two well-known continuous games. We believe the equivalence relation will lend itself to new insights by translating the theoretical guarantees from one formalism to another. Moreover, it may lead to new computational approaches for continuous games when a problem is more naturally solved in the succinct format of multi-objective games.
翻译:用于研究多试剂系统中战略决策的经典模型是普通游戏。 这个模型可以被推广, 以允许无限数量的纯战略导致连续游戏。 多目标的普通游戏是另一种常规游戏, 模型设置让玩家在多个目标中分别得到报酬。 我们通过提供理论保证, 将游戏从一个环境转换成另一个游戏, 缩小两种模式之间的差距。 我们将理论结果扩大到包括Nash equilibria的保证等值。 绘图使得从一个领域将算法应用到另一个领域比较简单。 我们通过引入多目标游戏的虚拟游戏算法, 并随后将其应用到两个众所周知的连续游戏, 来证明这一点。 我们相信, 等同关系可以通过将理论保证从一个形式转变为另一个形式来进行新的洞察。 此外, 当一个问题更自然地在多目标游戏的简明格式中得到解决时, 它可能导致新的连续游戏的计算方法。