2000 character limit reached
covering simplicial game complex
Published 8 Jun 2023 in math.CO, math.AT, and math.GN | (2306.05114v1)
Abstract: In this paper, we introduce a simplicial complex representation for finite non-cooperative games in the strategic form. The covering space of the simplicial game complex is introduced and we show that the covering complex is a powerful tool to find Nash Equilibrium simplices. This representation allows us to model the cost functions of a game as a weight number on a dual vertex of the strategy situation in some stars. It yields a canonical direct sum decomposition of an arbitrary game into three components, as the potential, harmonic and nonstrategic components.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.