Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
From MaRDI portal
Recommendations
- Efficient computation of equilibria for extensive two-person games
- Equilibrium computation for two-player games in strategic and extensive form
- Computing a quasi-perfect equilibrium of a two-player game
- Efficient computation of behavior strategies
- A new sequence form approach for the enumeration and refinement of all extreme Nash equilibria for extensive form games
Cited in
(40)- The value of large extensive form games
- Normal form structures in extensive form games
- Efficient computation of multiple solutions in quasibrittle fracture analysis
- 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
- Finding mixed strategies with small supports in extensive form games
- Efficient computation of behavior strategies
- Efficient computation of equilibria for extensive two-person games
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
- A differentiable path-following method to compute subgame perfect equilibria in stationary strategies in robust stochastic games and its applications
- Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
- Computational complexity of computing a quasi-proper equilibrium
- A variant of Harsanyi's tracing procedures to select a perfect equilibrium in normal form games
- An extension of quantal response equilibrium and determination of perfect equilibrium
- A differentiable homotopy method to compute perfect equilibria
- Behavioural strategies in weighted Boolean games
- A note on bimatrix game maximal Selten subsets
- Game Theory Explorer: software for the applied game theorist
- Geometrie und Kombinatorik von Nash-Gleichgewichten.
- Fast algorithms for finding randomized strategies in game trees
- An exact double-oracle algorithm for zero-sum extensive-form games with imperfect information
- A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
- Equilibrium computation for two-player games in strategic and extensive form
- A new sequence form approach for the enumeration and refinement of all extreme Nash equilibria for extensive form games
- scientific article; zbMATH DE number 177098 (Why is no real title available?)
- A Nonlinear Programming Approach to Determine a Generalized Equilibrium for N-Person Normal Form Games
- Fast Algorithms for Rank-1 Bimatrix Games
- Generalized correlated equilibrium for two-person games in extensive form with perfect information
- Deflation for semismooth equations
- A variant of the logistic quantal response equilibrium to select a perfect equilibrium
- Computing perfect stationary equilibria in stochastic games
- Two-person adversarial games are zero-sum: an elaboration of a folk theorem
- A sequence-form differentiable path-following method to compute Nash equilibria
- A relation between perfect equilibria in extensive form games and proper equilibria in normal form games
- Computation of equilibria in noncooperative games
- Computing a quasi-perfect equilibrium of a two-player game
- Homotopy methods to compute equilibria in game theory
- Equilibrium tracing in strategic-form games
- Computing sequential equilibria using agent quantal response equilibria
- New complexity results about Nash equilibria
- Finding all equilibria in games of strategic complements
This page was built for publication: Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5474976)
