Matrix expressions of symmetric n-player games

Yuanhua Wang, Ying Wang, Haitao Li and Wenke Zang

Applied Mathematics and Computation, 2025, vol. 488, issue C

Abstract: The symmetric property in n-player games is explored in this paper. First of all, some algebraically verifiable conditions are provided respectively for the totally symmetric, weakly symmetric and anonymous games, which are based on the construction of permutation matrix, and some interesting properties are revealed. Then we investigate how network structures affect the symmetry in a networked game. Some sufficient conditions are proposed and several nice properties are preserved when traditional networked games are extended to generalized networked games, in which the resulting network structure is more complex than a classical network graph.

Keywords: Symmetric games; Algebraic verification; Networked games; Semi-tensor product (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324005952
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:488:y:2025:i:c:s0096300324005952

DOI: 10.1016/j.amc.2024.129134

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().