Efficient computation of behavior strategies

DOI10.1006/game.1996.0050zbMath0867.90131OpenAlexW2136427775MaRDI QIDQ1815000

Bernhard von Stengel

Publication date: 4 August 1997

Published in: Games and Economic Behavior (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/267dd3b620ea83a164b24e36b3240289e483602e

zbMATH Keywords

extensive game with perfect recallsequence form

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Noncooperative games (91A10) 2-person games (91A05)

Related Items (25)

Computing a quasi-perfect equilibrium of a two-player game ⋮ Homotopy methods to compute equilibria in game theory ⋮ Enumeration of Nash equilibria for two-player games ⋮ Structure theorems for game trees ⋮ Recursive Inspection Games ⋮ Representations and solutions for game-theoretic problems ⋮ Solving zero-sum one-sided partially observable stochastic games ⋮ A characterization of quasi-perfect equilibria ⋮ Polytope-form games and index/degree theories for extensive-form games ⋮ Presenting an algorithm to find Nash equilibrium in two-person static games with many strategies ⋮ First-order algorithm with \({\mathcal{O}(\ln(1/\epsilon))}\) convergence for \({\epsilon}\)-equilibrium in two-person zero-sum games ⋮ Approximating maxmin strategies in imperfect recall games using A-loss recall property ⋮ New complexity results about Nash equilibria ⋮ Zero-Sum Two Person Games ⋮ A NEW SEQUENCE FORM APPROACH FOR THE ENUMERATION AND REFINEMENT OF ALL EXTREME NASH EQUILIBRIA FOR EXTENSIVE FORM GAMES ⋮ 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 ⋮ Bargaining with limited computation: Deliberation equilibrium ⋮ A new lower bound for the list update problem in the partial cost model ⋮ Faster algorithms for extensive-form game solving via improved smoothing functions ⋮ Automated construction of bounded-loss imperfect-recall abstractions in extensive-form games ⋮ Conditional dominance, rationalizability, and game forms ⋮ Multi-agent reinforcement learning: a selective overview of theories and algorithms ⋮ Game Theory Explorer: software for the applied game theorist

This page was built for publication: Efficient computation of behavior strategies