arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1701.06807cs.GTmath.OC
收藏

对称对策的线性表示

Linear Representation of Symmetric Games

Daizhan Cheng, Ting Liu

摘要:

利用矩阵的半张量积,以对称群在对策结构向量上的线性表示为表示空间,研究了几类对称对策的结构.首先,将对称群对支付函数的作用转化为置换矩阵与支付函数结构向量的乘积。利用对称群在结构向量上的线性表示,分别得到了普通对称、加权对称、重命名对称和与名称无关对称在相应的线性表示下不变性的代数条件.其次,利用线性表示研究了对称对策与势对策之间的关系。这一部分主要讨论布尔博弈。另一种证明表明,普通的,重命名和加权对称布尔博弈也是潜在的框架下。并得到了相应的势函数。最后通过一个例子说明了其他布尔博弈也可以是潜在博弈。

英文摘要:

Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the symmetry, described as the action of symmetric group on payoff functions, is converted into the product of permutation matrices with structure vectors of payoff functions. Using the linear representation of the symmetric group in structure vectors, the algebraic conditions for the ordinary, weighted, renaming and name-irrelevant symmetries are obtained respectively as the invariance under the corresponding linear representations. Secondly, using the linear representations the relationship between symmetric games and potential games is investigated. This part is mainly focused on Boolean games. An alternative proof is given to show that ordinary, renaming and weighted symmetric Boolean games are also potential ones under our framework. The corresponding potential functions are also obtained. Finally, an example is given to show that some other Boolean games could also be potential games.

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

↑