Computation of sparse and dense equilibrium strategies of evolutionary games

DOI10.3390/g9030046zbMath1418.91080OpenAlexW2874996774MaRDI QIDQ1630457

Yiping Hao, Zhi-jun Wu

Publication date: 10 December 2018

Published in: Games (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/g9030046

zbMATH Keywords

Nash equilibriumevolutionary gamesbiodiversitydense vs. sparse strategiesShapley-Snow algorithm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10) Evolutionary games (91A22) Software, source code, etc. for problems pertaining to game theory, economics, and finance (91-04)

Related Items

Chris Cannings: a life in games

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
• Enhancing sparsity by reweighted \(\ell _{1}\) minimization
• Algorithms for the solution of quadratic knapsack problems
• New complexity results about Nash equilibria
• Nash and correlated equilibria: Some complexity considerations
• Evolution towards the maximum clique
• Two-person nonzero-sum games and quadratic programming
• Non-cooperative games
• Evolutionary Games and Population Dynamics
• On oblivious PTAS's for nash equilibrium
• Regularization and Variable Selection Via the Elastic Net
• Equilibrium Points of Bimatrix Games
• Maxima for Graphs and a New Proof of a Theorem of Turán
• The Logic of Animal Conflict
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Stable signal recovery from incomplete and inaccurate measurements
• Equilibrium points in n -person games