Pages that link to "Item:Q700098"
From MaRDI portal
The following pages link to Computation of the Nash equilibrium selected by the tracing procedure in \(N\)-person games (Q700098):
Displaying 16 items.
- Semidefinite programming for min-max problems and games (Q662286) (← links)
- Homotopy methods to compute equilibria in game theory (Q847802) (← links)
- Equilibrium tracing in strategic-form games (Q847803) (← links)
- Pricing in Bertrand competition with increasing marginal costs (Q926876) (← links)
- The tracing procedure: A self-correcting reasoning procedure (Q1089272) (← links)
- An algorithmic approach toward the tracing procedure for bi-matrix games (Q1300677) (← 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)
- Two simple proofs of the feasibility of the linear tracing procedure (Q1974609) (← 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)
- An arbitrary starting tracing procedure for computing subgame perfect equilibria (Q2194134) (← links)
- An algorithm for equilibrium selection in generalized Nash equilibrium problems (Q2419570) (← links)
- A dynamic homotopy interpretation of the logistic quantal response equilibrium correspondence (Q2485481) (← links)
- Equilibrium selection in games: the mollifier method (Q2486410) (← links)
- A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities (Q3460332) (← links)
- Parametric Computation of Minimum-Cost Flows with Piecewise Quadratic Costs (Q5076726) (← links)
