A parametric representation of totally mixed Nash equilibria
From MaRDI portal
Publication:979929
DOI10.1016/j.camwa.2009.06.043zbMath1189.91017OpenAlexW2023702551MaRDI QIDQ979929
Juan Sabia, Gabriela Jeronimo, Daniel Perrucci
Publication date: 28 June 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2009.06.043
complexityNash equilibriapolynomial equation solvingnoncooperative game theorymultihomogeneous resultants
Related Items
High-Dimensional Nash Equilibria Problems and Tensors Applications, Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies, Counting derangements and Nash equilibria
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
- Computing the equidimensional decomposition of an algebraic closed set by means of lifting fibers
- On computing the determinant in small parallel time using a small number of processors
- Definability and fast quantifier elimination in algebraically closed fields
- A globally convergent algorithm to compute all Nash equilibria for \(n\)-person games
- Finding all Nash equilibria of a finite game using polynomial algebra
- The complexity of elementary algebra and geometry
- Résolution des systèmes d'équations algébriques
- Comprehensive Gröbner bases
- The number of roots of a system of equations
- Solving zero-dimensional systems through the rational univariate representation
- On the Newton polytope of the resultant
- Product formulas for resultants and Chow forms
- Lower bounds for diophantine approximations
- The maximal number of regular totally mixed Nash equilibria
- Straight-line programs in geometric elimination theory
- Sparse resultant under vanishing coefficients
- Computing parametric geometric resolutions
- The maximum number of real roots of a multihomogeneous system of polynomial equations
- The Projective Noether Maple Package: Computing the dimension of a projective variety
- Effective equidimensional decomposition of affine varieties
- A concise proof of the Kronecker polynomial system solver from scratch
- Solving parametric polynomial systems
- Computing multihomogeneous resultants using straight-line programs
- Non-cooperative games
- Improved Algorithms for Sign Determination and Existential Quantifier Elimination
- Spécialisation de la suite de Sturm
- A Product-Decomposition Bound for Bezout Numbers
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Equilibrium Points of Bimatrix Games
- The Approximation of Fixed Points of a Continuous Mapping
- On Euclid's Algorithm and the Theory of Subresultants
- LATIN 2004: Theoretical Informatics
- Algorithms in real algebraic geometry
- Sylvester-Habicht sequences and fast Cauchy index computation
- A Gröbner free alternative for polynomial system solving
