The Theory of Universal Graphs for Games: Past and Future
Abstract
This paper surveys recent works about the notion of universal graphs. They were introduced in the context of parity games for understanding the recent quasipolynomial time algorithms, but they are defined for arbitrary objectives yielding a new approach for constructing efficient algorithms for solving different classes of games.
Domains
Computer Science [cs]| Origin | Files produced by the author(s) |
|---|
