A parametric representation of totally mixed Nash equilibria
From MaRDI portal
(Redirected from Publication:979929)
Recommendations
Cites work
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3759547 (Why is no real title available?)
- scientific article; zbMATH DE number 3461412 (Why is no real title available?)
- scientific article; zbMATH DE number 1273538 (Why is no real title available?)
- scientific article; zbMATH DE number 976329 (Why is no real title available?)
- scientific article; zbMATH DE number 1099369 (Why is no real title available?)
- scientific article; zbMATH DE number 3999284 (Why is no real title available?)
- scientific article; zbMATH DE number 3445379 (Why is no real title available?)
- scientific article; zbMATH DE number 1827070 (Why is no real title available?)
- scientific article; zbMATH DE number 806915 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A Gröbner free alternative for polynomial system solving
- A Product-Decomposition Bound for Bezout Numbers
- A concise proof of the Kronecker polynomial system solver from scratch
- A course in game theory.
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- Algorithms in real algebraic geometry
- Comprehensive Gröbner bases
- Computing multihomogeneous resultants using straight-line programs
- Computing parametric geometric resolutions
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- Definability and fast quantifier elimination in algebraically closed fields
- Effective equidimensional decomposition of affine varieties
- Equilibrium Points of Bimatrix Games
- Finding all Nash equilibria of a finite game using polynomial algebra
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Improved Algorithms for Sign Determination and Existential Quantifier Elimination
- LATIN 2004: Theoretical Informatics
- Lower bounds for diophantine approximations
- Modern computer algebra
- Non-cooperative games
- On Euclid's Algorithm and the Theory of Subresultants
- On computing the determinant in small parallel time using a small number of processors
- On the Newton polytope of the resultant
- Product formulas for resultants and Chow forms
- Résolution des systèmes d'équations algébriques
- Solving parametric polynomial systems
- Solving zero-dimensional systems through the rational univariate representation
- Sparse resultant under vanishing coefficients
- Spécialisation de la suite de Sturm
- Straight-line programs in geometric elimination theory
- Sylvester-Habicht sequences and fast Cauchy index computation
- The Approximation of Fixed Points of a Continuous Mapping
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- The Projective Noether Maple Package: Computing the dimension of a projective variety
- The complexity of elementary algebra and geometry
- The maximal number of regular totally mixed Nash equilibria
- The maximum number of real roots of a multihomogeneous system of polynomial equations
- The number of roots of a system of equations
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
Cited in
(8)- Algebraic solutions to completely mixed Nash equilibria in a 0-1 game
- An algorithm for payoff space in \(C^1\) parametric games
- Universality of Nash Equilibria
- Root counts of semi-mixed systems, and an application to counting Nash equilibria
- High-dimensional Nash equilibria problems and tensors applications
- Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies
- Algorithms for payoff trajectories in \(C^1\) parametric games
- Counting derangements and Nash equilibria
This page was built for publication: A parametric representation of totally mixed Nash equilibria
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q979929)