简单随机博弈的复杂性
计算复杂性
2007-05-23 v1 计算机科学与博弈论
摘要
本文综述了各类简单随机博弈问题的计算时间复杂性，并概述了与每个问题相关的最优已知算法。
关键词
引用
@article{arxiv.0704.2779,
title = {The Complexity of Simple Stochastic Games},
author = {Jonas Dieckelmann},
journal= {arXiv preprint arXiv:0704.2779},
year = {2007}
}
评论
Hi, while reading through literature i noticed that it has not yet been proved that computing the value vector of simple stochastic games is a Problem in FNP. This is why i came up with a prove in this seminar work of mine