Pages that link to "Item:Q1399543"

The following pages link to A global Newton method to compute Nash equilibria. (Q1399543):

Displaying 35 items.

• Computational analysis of perfect-information position auctions (Q523528) (← links)
• Formulating an \(n\)-person noncooperative game as a tensor complementarity problem (Q523577) (← links)
• Action-graph games (Q625044) (← links)
• Semidefinite programming for min-max problems and games (Q662286) (← links)
• Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games (Q700098) (← links)
• A decomposition algorithm for \(N\)-player games (Q847797) (← links)
• Homotopy methods to compute equilibria in game theory (Q847802) (← links)
• Equilibrium tracing in strategic-form games (Q847803) (← links)
• Simple search methods for finding a Nash equilibrium (Q932813) (← links)
• Computing Nash equilibria by iterated polymatrix approximation (Q953636) (← links)
• Global Newton method for stochastic games (Q1001834) (← links)
• Symmetries and the complexity of pure Nash equilibrium (Q1004282) (← links)
• Successful Nash equilibrium agent for a three-player imperfect-information game (Q1651920) (← 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)
• Limited-trust equilibria (Q2028831) (← 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)
• Differential evolution particle swarm optimization algorithm based on good point set for computing Nash equilibrium of finite noncooperative game (Q2131540) (← links)
• A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games (Q2155890) (← links)
• Logit equilibrium as an approximation of Nash equilibrium (Q2183201) (← links)
• A differentiable homotopy method to compute perfect equilibria (Q2220655) (← links)
• Partially observable game-theoretic agent programming in Golog (Q2300459) (← links)
• Polynomial-time computation of exact correlated equilibrium in compact games (Q2347787) (← links)
• Newton's method for computing a normalized equilibrium in the generalized Nash game through fixed point formulation (Q2429460) (← links)
• A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence (Q2485481) (← links)
• Robust game theory (Q2492691) (← links)
• Graph Transduction as a Noncooperative Game (Q2885112) (← links)
• A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities (Q3460332) (← links)
• Fast Algorithms for Rank-1 Bimatrix Games (Q4994178) (← links)
• A dynamical neural network approach for solving stochastic two-player zero-sum games (Q6077009) (← links)
• The computation of pairwise stable networks (Q6120904) (← links)
• Polytope-form games and index/degree theories for extensive-form games (Q6176749) (← links)
• Distributed Nash equilibrium seeking with stochastic event-triggered mechanism (Q6491072) (← links)
• A variant of the logistic quantal response equilibrium to select a perfect equilibrium (Q6582422) (← links)
• Globally and universally convergent price adjustment processes (Q6596155) (← links)