Pages that link to "Item:Q2392820"
From MaRDI portal
The following pages link to Computing generalized Nash equilibria by polynomial programming (Q2392820):
Displaying 12 items.
- Computing Nash equilibria by iterated polymatrix approximation (Q953636) (← links)
- Note on unique Nash equilibrium in continuous games (Q1651236) (← links)
- Computing all solutions of linear generalized Nash equilibrium problems (Q2014367) (← links)
- The Gauss-Seidel method for generalized Nash equilibrium problems of polynomials (Q2028496) (← links)
- A competitive optimal stopping game (Q2098917) (← links)
- Finding multiple Nash equilibria via machine learning-supported Gröbner bases (Q2178154) (← links)
- A Bayesian Monte Carlo method for computing the Shapley value: application to weighted voting and bin packing games (Q2664449) (← links)
- Convex generalized Nash equilibrium problems and polynomial optimization (Q2693649) (← links)
- On Structure and Computation of Generalized Nash Equilibria (Q5300534) (← links)
- LATIN 2004: Theoretical Informatics (Q5901661) (← links)
- Rational Generalized Nash Equilibrium Problems (Q6116245) (← links)
- On the polyhedral homotopy method for solving generalized Nash equilibrium problems of polynomials (Q6159023) (← links)