ダウンロード数: 147
このアイテムのファイル:
| ファイル | 記述 | サイズ | フォーマット | |
|---|---|---|---|---|
| s00453-017-0372-7.pdf | 587.7 kB | Adobe PDF | 見る/開く |
| タイトル: | Approximation Schemes for Stochastic Mean Payoff Games with Perfect Information and Few Random Positions |
| 著者: | Boros, Endre Elbassioni, Khaled Fouz, Mahmoud Gurvich, Vladimir Makino, Kazuhisa Manthey, Bodo |
| 著者名の別形: | 牧野, 和久 |
| キーワード: | Stochastic mean payoff games Approximation schemes Approximation algorithms Nash equilibrium |
| 発行日: | Nov-2018 |
| 出版者: | Springer Nature America, Inc |
| 誌名: | Algorithmica |
| 巻: | 80 |
| 号: | 11 |
| 開始ページ: | 3132 |
| 終了ページ: | 3157 |
| 抄録: | We consider two-player zero-sum stochastic mean payoff games with perfect information. We show that any such game, with a constant number of random positions and polynomially bounded positive transition probabilities, admits a polynomial time approximation scheme, both in the relative and absolute sense. |
| 著作権等: | © The Author(s) 2017. This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. |
| URI: | http://hdl.handle.net/2433/236123 |
| DOI(出版社版): | 10.1007/s00453-017-0372-7 |
| 出現コレクション: | 学術雑誌掲載論文等 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。