Pages that link to "Item:Q953636"

The following pages link to Computing Nash equilibria by iterated polymatrix approximation (Q953636):

Displaying 12 items.

• On perfect Nash equilibria of polymatrix games (Q457873) (← links)
• Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
• Action-graph games (Q625044) (← links)
• A decomposition algorithm for \(N\)-player games (Q847797) (← links)
• Homotopy methods to compute equilibria in game theory (Q847802) (← links)
• A global Newton method to compute Nash equilibria. (Q1399543) (← links)
• Zero-sum polymatrix games with link uncertainty: a Dempster-Shafer theory solution (Q2007652) (← links)
• Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria (Q2115252) (← links)
• A differentiable homotopy method to compute perfect equilibria (Q2220655) (← links)
• Partially observable game-theoretic agent programming in Golog (Q2300459) (← links)
• Game Theory Explorer: software for the applied game theorist (Q2356171) (← links)
• A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence (Q2485481) (← links)