A DYNAMIC PROGRAMMING ALGORITHM FOR OPTIMIZING BASEBALL STRATEGIES

• 資料種別: 記事
• タイトル: A DYNAMIC PROGRAMMING ALGORITHM FOR OPTIMIZING BASEBALL STRATEGIES
• 著者・編者: Akifumi Kira; Keisuke Inakawa; Toshiharu Fujita
• 著者標目: Akifumi Kira; Keisuke Inakawa; Toshiharu Fujita
• タイトル（掲載誌）: Journal of the Operations Research Society of Japan
• 巻号年月日等（掲載誌）: 62(2):2019.4
• 掲載巻: 62
• 掲載号: 2
• 掲載ページ: 64-82
• 掲載年月日（W3CDTF）: 2019-04
• ISSN（掲載誌）: 0453-4514
• ISSN-L（掲載誌）: 0453-4514
• 出版事項（掲載誌）: Tokyo : Operations Research Society of Japan
• 出版地（国名コード）: JP
• 本文の言語コード: eng
• 件名標目: Dynamic programming; OR in sports; Markov perfect equilibrium; advantage of the last-batting team; optimal lineup
• NDLC: ZM31
• 対象利用者: 一般
• 所蔵機関: 国立国会図書館
• 請求記号: Z53-M226
• 連携機関・データベース: 国立国会図書館 : 国立国会図書館雑誌記事索引; https://ndlsearch.ndl.go.jp
• 書誌ID（NDLBibID）: 029632872; http://id.ndl.go.jp/bib/029632872
• 整理区分コード: 632

• 要約等: <p>In this paper, baseball is formulated as a finite non-zero-sum Markov game with approximately 6.45 million states. We give an effective dynamic programming algorithm which computes equilibrium strategies and the equilibrium winning percentages for both teams in less than 2 second per game. Optimal decision making can be found depending on the situation—for example, for the batting team, whether batting for a hit, stealing a base or sacrifice bunting will maximize their win percentage, or for the fielding team, whether to pitch to or intentionally walk a batter, yields optimal results. Based on this model, we discuss whether the last-batting team has an advantage. In addition, we compute the optimal batting order, in consideration of the decision making in a game.</p>
• DOI: 10.15807/jorsj.62.64
• オンライン閲覧公開範囲: インターネット公開
• 連携機関・データベース: 科学技術振興機構 : J-STAGE; http://www.jstage.jst.go.jp

• 要約等: <p>In this paper, baseball is formulated as a finite non-zero-sum Markov game with approximately 6.45 million states. We give an effective dynamic programming algorithm which computes equilibrium strategies and the equilibrium winning percentages for both teams in less than 2 second per game. Optimal decision making can be found depending on the situation—for example, for the batting team, whether batting for a hit, stealing a base or sacrifice bunting will maximize their win percentage, or for the fielding team, whether to pitch to or intentionally walk a batter, yields optimal results. Based on this model, we discuss whether the last-batting team has an advantage. In addition, we compute the optimal batting order, in consideration of the decision making in a game.</p>
• DOI: 10.15807/jorsj.62.64; https://doi.org/10.15807/jorsj.62.64
• オンライン閲覧公開範囲: インターネット公開
• 関連情報（URI）: http://hdl.handle.net/10228/00007296; https://kyutech.repo.nii.ac.jp/records/6086; http://id.ndl.go.jp/bib/029632872; https://ndlsearch.ndl.go.jp/books/R000000004-I029632872; https://www.jstage.jst.go.jp/article/jorsj/62/2/62_64/_pdf
• 参照: The variance of discounted Markov decision processes; https://cir.nii.ac.jp/crid/1360011145568702720; Optimal threshold probability and expectation in semi-Markov decision processes; https://cir.nii.ac.jp/crid/1360292618945355392; Threshold probability of non-terminal type in finite horizon Markov decision processes; https://cir.nii.ac.jp/crid/1360567182242236544; AN APPLICATION OF A DISCRETE FIXED POINT THEOREM TO A GAME IN EXPANSIVE FORM; https://cir.nii.ac.jp/crid/1360567186114362624; 11. Extensive Games and the Problem of Information; https://cir.nii.ac.jp/crid/1360574094435111296; Minimizing a Threshold Probability in Discounted Markov Decision Processes; https://cir.nii.ac.jp/crid/1360574095032793600; Dynamic Programming; https://cir.nii.ac.jp/crid/1360855568803162624; Target-level criterion in Markov decision processes; https://cir.nii.ac.jp/crid/1360855569244751232; Time Consistent Dynamic Risk Measures; https://cir.nii.ac.jp/crid/1361137045501899776; An Offensive Earned-Run Average for Baseball; https://cir.nii.ac.jp/crid/1361418519570535040; Optimal threshold probability in undiscounted Markov decision processes with a target set; https://cir.nii.ac.jp/crid/1361699995184455936; Stochastic Target Hitting Time and the Problem of Early Retirement; https://cir.nii.ac.jp/crid/1361699996293797504; Minimizing Risk Models in Markov Decision Processes with Policies Depending on Target Values; https://cir.nii.ac.jp/crid/1362825893429332224; Stochastic Games; https://cir.nii.ac.jp/crid/1362825895892609920; A Markov Chain Approach to Baseball; https://cir.nii.ac.jp/crid/1363107368375189120; In Search of the "Last-Ups" Advantage in Baseball: A Game-Theoretic Approach; https://cir.nii.ac.jp/crid/1363388843912129920; Optimal policy for minimizing risk models in Markov decision processes; https://cir.nii.ac.jp/crid/1363388844271755904; Modified offensive earned-run average with steal effect for baseball; https://cir.nii.ac.jp/crid/1363670318879112960; Modelling a baseball game to optimise pitcher substitution strategies incorporating handedness of players; https://cir.nii.ac.jp/crid/1364233270667612288; A MARKOV CHAIN APPROACH TO OPTIMAL PINCH HITTING STRATEGIES IN A DESIGNATED HITTER RULE BASEBALL GAME; https://cir.nii.ac.jp/crid/1390282679087043328
• 連携機関・データベース: 国立情報学研究所 : CiNii Research; https://cir.nii.ac.jp/
• 提供元機関・データベース: Japan Link Center; https://japanlinkcenter.org/top; 学術機関リポジトリデータベース; https://irdb.nii.ac.jp; 雑誌記事索引データベース; https://ndlsearch.ndl.go.jp; Crossref; https://www.crossref.org; CiNii Articles; 科学研究費助成事業データベース; https://kaken.nii.ac.jp/ja
• 書誌ID（NDLBibID）: 029632872; http://id.ndl.go.jp/bib/029632872
• NII論文ID: 130007636494