arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2405.06253cs.GTmath.OC
收藏

关于势博弈与序数势博弈的刻画

On Characterizations of Potential and Ordinal Potential Games

Sina Arefizadeh, Angelia Nedich, Gautam Dasarathy

AI总结:

本文刻画势博弈的充要条件,将经典结果推广到多维行动空间,提出基于成本差异构造势函数的方法,并给出序数及广义序数势博弈的充分条件。

摘要:

本文研究了一个博弈成为势博弈的若干充要条件。首先,我们将 Slade 以及 Monderer 和 Shapley 的经典结果从具有一维行动空间的博弈推广到具有多维行动空间的博弈,后者要求成本函数可微。随后,我们通过依据参与者成本差异(而非微分)考察势函数的结构,给出了博弈存在势函数的一个充要条件。该条件为构造势函数提供了一种系统化方法,并作为示例应用于网络拥塞博弈。最后,我们给出了博弈成为序数势博弈和广义序数势博弈的一些充分条件。

英文摘要:

This paper investigates some necessary and sufficient conditions for a game to be a potential game. At first, we extend the classical results of Slade and Monderer and Shapley from games with one-dimensional action spaces to games with multi-dimensional action spaces, which require differentiable cost functions. Then, we provide a necessary and sufficient conditions for a game to have a potential function by investigating the structure of a potential function in terms of the players' cost differences, as opposed to differentials. This condition provides a systematic way for construction of a potential function, which is applied to network congestion games, as an example. Finally, we provide some sufficient conditions for a game to be ordinal potential and generalized ordinal potential.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑