Root counts of semi-mixed systems, and an application to counting nash equilibria

DOI10.1145/2608628.2608679zbMath1325.68275OpenAlexW2027815348WikidataQ57908673 ScholiaQ57908673MaRDI QIDQ3452389

Ioannis Z. Emiris, Raimundas Vidunas

Publication date: 11 November 2015

Published in: Proceedings of the 39th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2608628.2608679

zbMATH Keywords

Nash equilibriumgenerating functionmixed volumematrix permanentmultihomogeneous Bézout bound

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Noncooperative games (91A10) Determinants, permanents, traces, other special matrix functions (15A15) Solving polynomial systems; resultants (13P15)

Related Items (7)

The m-Bézout bound and distance geometry ⋮ Computing mixed volume and all mixed cells in quermassintegral time ⋮ Unmixing the mixed volume computation ⋮ Multilinear polynomial systems: root isolation and bit complexity ⋮ Counting derangements and Nash equilibria ⋮ On the multihomogeneous Bézout bound on the number of embeddings of minimally rigid graphs ⋮ Matrix formulæ for resultants and discriminants of bivariate tensor-product polynomials

Uses Software

• Jordan

Cites Work

• An effective implementation of symbolic-numeric cylindrical algebraic decomposition for quantifier elimination
• Cylindrical algebraic decomposition using validated numerics
• The Jordan Curve Theorem, Formally and Informally
• On Computable Numbers, with an Application to the Entscheidungsproblem
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item

This page was built for publication: Root counts of semi-mixed systems, and an application to counting nash equilibria