Efficient computation of behavior strategies
From MaRDI portal
Publication:1815000
Recommendations
- Efficient computation of equilibria for extensive two-person games
- Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
- Equilibrium computation for two-player games in strategic and extensive form
- Finding mixed strategies with small supports in extensive form games
- The complexity of two-person zero-sum games in extensive form
Cited in
(32)- HSVI can solve zero-sum partially observable stochastic games
- Recursive inspection games
- Polytope-form games and index/degree theories for extensive-form games
- Conditional dominance, rationalizability, and game forms
- Structure theorems for game trees
- The complexity of two-person zero-sum games in extensive form
- scientific article; zbMATH DE number 5547974 (Why is no real title available?)
- Limited lookahead in imperfect-information games
- Computing Normal Form Perfect Equilibria for Extensive Two-Person Games
- The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game
- Simple uncoupled no-regret learning dynamics for extensive-form correlated equilibrium
- A characterization of quasi-perfect equilibria
- Approximating maxmin strategies in imperfect recall games using A-loss recall property
- Efficient computation of equilibria for extensive two-person games
- Representations and solutions for game-theoretic problems
- Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies
- Game Theory Explorer: software for the applied game theorist
- Bargaining with limited computation: Deliberation equilibrium
- A new sequence form approach for the enumeration and refinement of all extreme Nash equilibria for extensive form games
- Enumeration of Nash equilibria for two-player games
- Homotopy methods to compute equilibria in game theory
- Multi-agent reinforcement learning: a selective overview of theories and algorithms
- First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games
- Computing a quasi-perfect equilibrium of a two-player game
- Fast algorithms for finding randomized strategies in game trees
- Zero-sum two person games
- Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games
- Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game in extensive form and corresponding mathematical programming problem
- Solving zero-sum one-sided partially observable stochastic games
- New complexity results about Nash equilibria
- Faster algorithms for extensive-form game solving via improved smoothing functions
- A new lower bound for the list update problem in the partial cost model
This page was built for publication: Efficient computation of behavior strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1815000)
