Efficient computation of equilibria for extensive two-person games
From MaRDI portal
(Redirected from Publication:1815001)
Recommendations
Cited in
(44)- Polynomial-time computation of exact correlated equilibrium in compact games
- Exploiting extensive-form structure in empirical game-theoretic analysis
- Computational complexity of computing a quasi-proper equilibrium
- Polytope-form games and index/degree theories for extensive-form games
- A theoretical and empirical investigation of search in imperfect information games
- Conditional dominance, rationalizability, and game forms
- The value of large extensive form games
- Computing Proper Equilibria of Zero-Sum Games
- Computing sequential equilibria using agent quantal response equilibria
- A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
- Good neighbors are hard to find: Computational complexity of network formation
- The complexity of two-person zero-sum games in extensive form
- Computing lexicographically safe Nash equilibria in finite two-person games with tight game forms given by oracles
- Limited lookahead in imperfect-information games
- Algorithms for computing strategies in two-player simultaneous move 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
- Approximating maxmin strategies in imperfect recall games using A-loss recall property
- Representations and solutions for game-theoretic problems
- Bargaining with limited computation: Deliberation equilibrium
- Solving for Best Responses and Equilibria in Extensive-Form Games with Reinforcement Learning Methods
- Algorithms and Computation
- Computation of equilibria in noncooperative games
- 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
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
- The computational complexity of trembling hand perfection and other equilibrium refinements
- Computing a quasi-perfect equilibrium of a two-player game
- A continuation method for Nash equilibria in structured games
- Computational complexity in additive hedonic games
- Extensive-form correlated equilibrium: definition and computational complexity
- The give and take game: analysis of a resource sharing game
- The Effective Computation of Equilibrium Point for N-Person Games Cyclic to the Next Person
- 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
- Finding Equilibria in Games of No Chance
- New complexity results about Nash equilibria
- Equilibrium computation for two-player games in strategic and extensive form
- On taxed matrix games and changes in the expected transfer
- Online learning in sequential Bayesian persuasion: handling unknown priors
- Faster algorithms for extensive-form game solving via improved smoothing functions
This page was built for publication: Efficient computation of 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 Q1815001)
