Pages that link to "Item:Q3780024"
From MaRDI portal
The following pages link to Simplicial Variable Dimension Algorithms for Solving the Nonlinear Complementarity Problem on a Product of Unit Simplices Using a General Labelling (Q3780024):
Displaying 16 items.
- Computational analysis of perfect-information position auctions (Q523528) (← links)
- Action-graph games (Q625044) (← links)
- Extension of GAMS for complementarity problems arising in applied economic analysis (Q672669) (← links)
- Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron (Q756763) (← links)
- Homotopy methods to compute equilibria in game theory (Q847802) (← links)
- Simple search methods for finding a Nash equilibrium (Q932813) (← links)
- Some computational methods for systems of nonlinear equations and systems of polynomial equations (Q1201902) (← links)
- A mixed 0-1 linear programming approach to the computation of all pure-strategy Nash equilibria of a finite \(n\)-person game in normal form (Q1718839) (← links)
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games (Q2155890) (← links)
- Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787) (← links)
- Game Theory Explorer: software for the applied game theorist (Q2356171) (← links)
- Robust game theory (Q2492691) (← links)
- Graph Transduction as a Noncooperative Game (Q2885112) (← links)
- A new simplicial variable dimension algorithm to find equilibria on the product space of unit simplices (Q4726068) (← links)
- Existence of balanced simplices on polytopes. (Q5953376) (← links)
- A dynamical neural network approach for solving stochastic two-player zero-sum games (Q6077009) (← links)
