Skip to main content

University of Siegen

Organization1 report

1 document by University of Siegen in the Game Industry Library, the newest “Game Tree Search in a Robust Multistage Optimization Framework: Exploiting Pruning Mechanisms” (2020).

Documents

Cover of Game Tree Search in a Robust Multistage Optimization Framework: Exploiting Pruning Mechanisms
Whitepaper16 pages

Game Tree Search in a Robust Multistage Optimization Framework: Exploiting Pruning Mechanisms

Quantified Integer Programs serve as a critical framework for modeling decision-making under uncertainty, effectively representing these challenges as two-person zero-sum games.

  • Integrating Strategic Copy-Pruning into the Yasol solver increased the number of successfully solved instances for complex runway scheduling problems from 14 to 25.
  • Strategic Copy-Pruning enables the reuse of existential strategies across universal node branches, allowing for the implicit deduction of strategy existence in linear time.
  • The framework models decision-making under uncertainty as two-person zero-sum games to address the computational complexity of PSPACE-complete optimization problems.
AIGame DesignStrategy+1
University of SiegenJan 2020

Do you work at University of Siegen? Get a free report of how these documents are read and cited here.