| 作成者 |
|
|
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| Crossref DOI |
|
| 概要 |
We formulate baseball as a finite Markov game with approximately 3.5 million states. The manager of each opposing team is the player who maximizes the probability of their team winning. We derive, usi...ng dynamic programming, a recursive formula that is satisfied by Markov perfect equilibria and the value functions of the game for both teams. By solving this recursive formula, we can obtain optimal strategies for each condition. We demonstrate with numerical experiments that these can be calculated in approximately 1 second per game.続きを見る
|
Mendeley出力
BIC46-2014-2--Kira-Inakawa