arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.13128cs.GTcs.DMcs.MAcs.SI
收藏

可分对策

Separable games

Laura Arditti, Giacomo Como, Fabio Fagnani

摘要:

本文提出了关于正向超图的可分对策的概念,它是图对策概念的改进和推广。首先,我们证明了存在一个最小的FDH-图,相对于游戏是可分离的,提供了一个最小的复杂性描述的游戏。然后,我们证明了一个对称性的最小FDH-图的潜在的游戏,我们描述了它如何反映到一个分解的潜在的功能方面的本地功能。特别是,这些最后的结果加强了最近证明的图形潜在的游戏。最后,我们研究了分离性和有限对策在其调和和潜在的组件的分解之间的相互作用,表征这两个组件的分离性。

英文摘要:

We present the notion of separable game with respect to a forward directed hypergraph (FDH-graph), which refines and generalizes that of graphical game. First, we show that there exists a minimal FDH-graph with respect to which a game is separable, providing a minimal complexity description for the game. Then, we prove a symmetry property of the minimal FDH-graph of potential games and we describe how it reflects to a decomposition of the potential function in terms of local functions. In particular, these last results strengthen the ones recently proved for graphical potential games. Finally, we study the interplay between separability and the decomposition of finite games in their harmonic and potential components, characterizing the separability properties of both such components.

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

↑