A parametric representation of totally mixed Nash equilibria

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
A concise proof of the Kronecker polynomial system solver from scratch
The Projective Noether Maple Package: Computing the dimension of a projective variety
Non-cooperative games
The maximal number of regular totally mixed Nash equilibria
Algorithms in real algebraic geometry
Solving zero-dimensional systems through the rational univariate representation
Straight-line programs in geometric elimination theory
Computing parametric geometric resolutions
A Gröbner free alternative for polynomial system solving
Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
Equilibrium Points of Bimatrix Games
The Approximation of Fixed Points of a Continuous Mapping
Sylvester-Habicht sequences and fast Cauchy index computation
On computing the determinant in small parallel time using a small number of processors
On the Newton polytope of the resultant
Comprehensive Gröbner bases
Solving parametric polynomial systems
The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
The number of roots of a system of equations
Modern computer algebra
Definability and fast quantifier elimination in algebraically closed fields
LATIN 2004: Theoretical Informatics
On Euclid's Algorithm and the Theory of Subresultants
A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
Finding all Nash equilibria of a finite game using polynomial algebra
Lower bounds for diophantine approximations
Résolution des systèmes d'équations algébriques
Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
Improved Algorithms for Sign Determination and Existential Quantifier Elimination
Effective equidimensional decomposition of affine varieties
Product formulas for resultants and Chow forms
The complexity of elementary algebra and geometry
A Product-Decomposition Bound for Bezout Numbers
Sparse resultant under vanishing coefficients
Computing multihomogeneous resultants using straight-line programs
The maximum number of real roots of a multihomogeneous system of polynomial equations
Spécialisation de la suite de Sturm

Cited In (4)

Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies
Parameterized two-player Nash equilibrium
Counting derangements and Nash equilibria
High-Dimensional Nash Equilibria Problems and Tensors Applications

Uses Software

Kronecker
Projective Noether
Gambit
ISOLATE

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)