Fast algorithms for finding randomized strategies in game trees

DOI10.1145/195058.195451zbMath1345.68258OpenAlexW1980717955MaRDI QIDQ2817671

Daphne Koller, Nimrod Megiddo, Bernhard von Stengel

Publication date: 1 September 2016

Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/195058.195451

Mathematics Subject Classification ID

Linear programming (90C05) 2-person games (91A05) Applications of game theory (91A80) Agent technology and artificial intelligence (68T42)

Related Items (13)

Simulating cardinal preferences in Boolean games: a proof technique ⋮ Computing a quasi-perfect equilibrium of a two-player game ⋮ Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm ⋮ Parallel approximation of min-max problems ⋮ Game theoretic resource allocation model for designing effective traffic safety solution against drunk driving ⋮ Representations and solutions for game-theoretic problems ⋮ From Duels to Battlefields: Computing Equilibria of Blotto and Other Games ⋮ Equilibrium semantics of languages of imperfect information ⋮ Multi-agent influence diagrams for representing and solving games. ⋮ A new lower bound for the list update problem in the partial cost model ⋮ Finding mixed strategies with small supports in extensive form games ⋮ Extending the alternating-offers protocol in the presence of competition: Models and theoretical analysis ⋮ Multi-agent reinforcement learning: a selective overview of theories and algorithms

This page was built for publication: Fast algorithms for finding randomized strategies in game trees