Enumeration of Nash equilibria for two-player games
From MaRDI portal
Publication:847809
Recommendations
- Equilibrium computation for two-player games in strategic and extensive form
- Simple search methods for finding a Nash equilibrium
- Enumeration of all extreme equilibria of bimatrix games
- Towards a black-box solver for finite games: computing all equlibria with gambit and PHCpack
- Efficient computation of equilibria for extensive two-person games
Cites work
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 3661140 (Why is no real title available?)
- scientific article; zbMATH DE number 1538127 (Why is no real title available?)
- scientific article; zbMATH DE number 3078984 (Why is no real title available?)
- A new sequence form approach for the enumeration and refinement of all extreme Nash equilibria for extensive form games
- A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
- A procedure for finding Nash equilibria in bi-matrix games
- A revised simplex method with integer Q-matrices
- AN ALGORITHM FOR EQUILIBRIUM POINTS IN BIMATRIX GAMES
- Algorithm 457: finding all cliques of an undirected graph
- Efficient computation of behavior strategies
- Enumeration of all extreme equilibria of bimatrix games
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Equilibrium Points of Bimatrix Games
- Equilibrium Points of Bimatrix Games
- How good are convex hull algorithms?
- Introduction to algorithms
- Maximal nash subsets for bimatrix games
- Nash and correlated equilibria: Some complexity considerations
- New maximal numbers of equilibria in bimatrix games
- Non-cooperative games
- On nash subsets of bimatrix games
- On the Strategic Stability of Equilibria
- Strategic Characterization of the Index of an Equilibrium
Cited in
(40)- Equilibrium payoffs of finite games
- Semidefinite Programming and Nash Equilibria in Bimatrix Games
- Algorithms for closed under rational behavior (CURB) sets
- Secure Multi-party Computation: Information Flow of Outputs and Game Theory
- Enumeration of all the extreme equilibria in game theory: bimatrix and polymatrix games
- Enumerating the Nash equilibria of rank 1-games
- Computing Simply Stable Equilibria
- Nash equilibria set computing in finite extended games
- A normal form game model of search and pursuit
- A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form
- Effects of profit taxes in matrix games
- Simple search methods for finding a Nash equilibrium
- Security games over lexicographic orders
- Enumeration of all extreme equilibria of bimatrix games
- Nondominated Nash points: application of biobjective mixed integer programming
- Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies
- Towards a black-box solver for finite games: computing all equlibria with gambit and PHCpack
- A note on bimatrix game maximal Selten subsets
- Game Theory Explorer: software for the applied game theorist
- scientific article; zbMATH DE number 3956853 (Why is no real title available?)
- Rational generating functions and integer programming games
- Homotopy methods to compute equilibria in game theory
- Computing all solutions of Nash equilibrium problems with discrete strategy sets
- scientific article; zbMATH DE number 5252503 (Why is no real title available?)
- A Polynomial Time Algorithm for Finding Nash Equilibria in Planar Win-Lose Games
- Automated equilibrium analysis of \(2\times 2\times 2\) games
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- On random symmetric bimatrix games
- A detail-free mediator
- An exact solution method for binary equilibrium problems with compensation and the power market uplift problem
- Enumerating vertices of covering polyhedra with totally unimodular constraint matrices
- Fast Algorithms for Rank-1 Bimatrix Games
- Enumerating vertices of \(0/1\)-polyhedra associated with \(0/1\)-totally unimodular matrices
- Finding all Nash equilibria of a finite game using polynomial algebra
- Automatic verification of concurrent stochastic systems
- A parametric representation of totally mixed Nash equilibria
- Equilibrium computation for two-player games in strategic and extensive form
- On taxed matrix games and changes in the expected transfer
- Nash equilibrium in a stochastic model of two competing athletes
This page was built for publication: Enumeration of Nash equilibria for two-player games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q847809)
