Pages that link to "Item:Q3363101"

The following pages link to The D1-Triangulation of Rn for Simplicial Algorithms for Computing Solutions of Nonlinear Equations (Q3363101):

Displaying 9 items.

• The \(D_ 2\)-triangulation for simplicial homotopy algorithms for computing solutions of nonlinear equations (Q687034) (← links)
• \(D_ 3\)-triangulation for simplicial deformation algorithms for computing solutions of nonlinear equations (Q1321243) (← links)
• A better triangulation for Wright's \(2^n\)-ray algorithm (Q1365094) (← 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 differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications (Q2076884) (← links)
• Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria (Q2115252) (← links)
• A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games (Q2155890) (← links)
• Computing an integer point of a class of convex sets. (Q5929418) (← links)
• Computing an integer point of a simplex with an arbitrary starting homotopy-like simplicial algorithm (Q5936075) (← links)