Efficient computation of equilibria for extensive two-person games
From MaRDI portal
Publication:1815001
DOI10.1006/game.1996.0051zbMath0859.90127OpenAlexW2086386133MaRDI QIDQ1815001
Daphne Koller, Nimrod Megiddo, Bernhard von Stengel
Publication date: 10 April 1997
Published in: Games and Economic Behavior (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.4639
2-person games (91A05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (27)
The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements ⋮ Algorithms for computing strategies in two-player simultaneous move games ⋮ Computational complexity of computing a quasi-proper equilibrium ⋮ Computing a quasi-perfect equilibrium of a two-player game ⋮ Homotopy methods to compute equilibria in game theory ⋮ Computing sequential equilibria using agent quantal response equilibria ⋮ A Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave Utilities ⋮ The give and take game: analysis of a resource sharing game ⋮ Representations and solutions for game-theoretic problems ⋮ Solving zero-sum one-sided partially observable stochastic games ⋮ Exploiting extensive-form structure in empirical game-theoretic analysis ⋮ Polytope-form games and index/degree theories for extensive-form games ⋮ On taxed matrix games and changes in the expected transfer ⋮ Approximating maxmin strategies in imperfect recall games using A-loss recall property ⋮ New complexity results about Nash equilibria ⋮ Good neighbors are hard to find: Computational complexity of network formation ⋮ Solving for Best Responses and Equilibria in Extensive-Form Games with Reinforcement Learning Methods ⋮ Limited lookahead in imperfect-information games ⋮ The complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form game ⋮ Nondominated equilibrium solutions of a multiobjective two-person nonzero-sum game in extensive form and corresponding mathematical programming problem ⋮ Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder ⋮ Bargaining with limited computation: Deliberation equilibrium ⋮ Faster algorithms for extensive-form game solving via improved smoothing functions ⋮ Conditional dominance, rationalizability, and game forms ⋮ Computational complexity in additive hedonic games ⋮ Multi-agent reinforcement learning: a selective overview of theories and algorithms ⋮ A theoretical and empirical investigation of search in imperfect information games
This page was built for publication: Efficient computation of equilibria for extensive two-person games