Pages that link to "Item:Q3962794"

The following pages link to On the Computation of Fixed Points in the Product Space of Unit Simplices and an Application to Noncooperative <i>N</i> Person Games (Q3962794):

Displaying 16 items.

• Sperner's lemma and zero point theorems on a discrete simplex and a discrete simplotope (Q412368) (← links)
• Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games (Q700098) (← links)
• Combinatorial analogs of Brouwer's fixed-point theorem on a bounded polyhedron (Q756763) (← links)
• Simplicial algorithm to solve the nonlinear complementarity problem on \(S^ n\times R^ m_ +\) (Q911481) (← links)
• Combinatorial integer labeling theorems on finite sets with applications (Q963665) (← links)
• Some computational methods for systems of nonlinear equations and systems of polynomial equations (Q1201902) (← links)
• An algorithmic approach toward the tracing procedure for bi-matrix games (Q1300677) (← links)
• A new variable dimension simplicial algorithm for computing economic equilibria on \(S^ n \times \mathbb{R}_ +^{m1}\) (Q1904696) (← links)
• Approximate Nash equilibria in anonymous games (Q2253838) (← links)
• Robust game theory (Q2492691) (← links)
• A Direct Reduction from k-Player to 2-Player Approximate Nash Equilibrium (Q3162514) (← links)
• A unifying model based on retraction for fixed point algorithms (Q3316473) (← links)
• A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm (Q3326743) (← links)
• A Lower Bound Technique for Triangulations of Simplotopes (Q4601211) (← 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)