The computation of Nash equilibrium in fashion games via semi-tensor product method

DOI10.1007/S11424-016-5057-9zbMath1347.91074OpenAlexW2510963298MaRDI QIDQ328801

Peilian Guo, Yuzhen Wang

Publication date: 21 October 2016

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-016-5057-9

zbMATH Keywords

Nash equilibriumsocial networksemi-tensor product of matricesfashion game

Mathematics Subject Classification ID

Social networks; opinion dynamics (91D30) Noncooperative games (91A10) Games involving graphs (91A43)

Related Items (4)

Fashion game on planar graphs ⋮ On basis and pure Nash equilibrium of finite pure harmonic games ⋮ Fashion game on graphs ⋮ Matching algorithms of minimum input selection for structural controllability based on semi-tensor product of matrices

Cites Work

• Unnamed Item
• Reachability/controllability of high order mix-valued logical networks
• Pure strategy equilibria in symmetric two-player zero-sum games
• A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems
• On finite potential games
• Stability of switched polynomial systems
• Solvability and control design for synchronization of Boolean networks
• Symmetries and the complexity of pure Nash equilibrium
• On the observability of free Boolean networks via the semi-tensor product method
• Algebraic formulation and strategy optimization for a class of evolutionary networked games via semi-tensor product method
• The fashion game: network extension of matching pennies
• A Semi-Tensor Product Approach to Pseudo-Boolean Functions with Application to Boolean Control Networks
• Solving type-2 fuzzy relation equations via semi-tensor product of matrices
• Semi-tensor product approach to networked evolutionary games
• Equilibrium points in n -person games

This page was built for publication: The computation of Nash equilibrium in fashion games via semi-tensor product method