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




Related Items (27)

The Computational Complexity of Trembling Hand Perfection and Other Equilibrium RefinementsAlgorithms for computing strategies in two-player simultaneous move gamesComputational complexity of computing a quasi-proper equilibriumComputing a quasi-perfect equilibrium of a two-player gameHomotopy methods to compute equilibria in game theoryComputing sequential equilibria using agent quantal response equilibriaA Complementary Pivot Algorithm for Market Equilibrium under Separable, Piecewise-Linear Concave UtilitiesThe give and take game: analysis of a resource sharing gameRepresentations and solutions for game-theoretic problemsSolving zero-sum one-sided partially observable stochastic gamesExploiting extensive-form structure in empirical game-theoretic analysisPolytope-form games and index/degree theories for extensive-form gamesOn taxed matrix games and changes in the expected transferApproximating maxmin strategies in imperfect recall games using A-loss recall propertyNew complexity results about Nash equilibriaGood neighbors are hard to find: Computational complexity of network formationSolving for Best Responses and Equilibria in Extensive-Form Games with Reinforcement Learning MethodsLimited lookahead in imperfect-information gamesThe complexity of computing a (quasi-)perfect equilibrium for an \(n\)-player extensive form gameNondominated equilibrium solutions of a multiobjective two-person nonzero-sum game in extensive form and corresponding mathematical programming problemPatrolling security games: definition and algorithms for solving large instances with single patroller and single intruderBargaining with limited computation: Deliberation equilibriumFaster algorithms for extensive-form game solving via improved smoothing functionsConditional dominance, rationalizability, and game formsComputational complexity in additive hedonic gamesMulti-agent reinforcement learning: a selective overview of theories and algorithmsA 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