{"@context":{"@vocab":"https://cir.nii.ac.jp/schema/1.0/","rdfs":"http://www.w3.org/2000/01/rdf-schema#","dc":"http://purl.org/dc/elements/1.1/","dcterms":"http://purl.org/dc/terms/","foaf":"http://xmlns.com/foaf/0.1/","prism":"http://prismstandard.org/namespaces/basic/2.0/","cinii":"http://ci.nii.ac.jp/ns/1.0/","datacite":"https://schema.datacite.org/meta/kernel-4/","ndl":"http://ndl.go.jp/dcndl/terms/","jpcoar":"https://github.com/JPCOAR/schema/blob/master/2.0/"},"@id":"https://cir.nii.ac.jp/crid/1390001288134511104.json","@type":"Article","productIdentifier":[{"identifier":{"@type":"DOI","@value":"10.15807/jorsj.62.64"}},{"identifier":{"@type":"HDL","@value":"http://hdl.handle.net/10228/00007296"}},{"identifier":{"@type":"URI","@value":"https://kyutech.repo.nii.ac.jp/records/6086"}},{"identifier":{"@type":"NDL_BIB_ID","@value":"029632872"}},{"identifier":{"@type":"URI","@value":"http://id.ndl.go.jp/bib/029632872"}},{"identifier":{"@type":"URI","@value":"https://ndlsearch.ndl.go.jp/books/R000000004-I029632872"}},{"identifier":{"@type":"URI","@value":"https://www.jstage.jst.go.jp/article/jorsj/62/2/62_64/_pdf"}},{"identifier":{"@type":"NAID","@value":"130007636494"}}],"resourceType":"学術雑誌論文(journal article)","dc:title":[{"@language":"en","@value":"A DYNAMIC PROGRAMMING ALGORITHM FOR OPTIMIZING BASEBALL STRATEGIES"}],"dc:language":"en","description":[{"type":"abstract","notation":[{"@language":"en","@value":"<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>"}],"abstractLicenseFlag":"disallow"}],"creator":[{"@id":"https://cir.nii.ac.jp/crid/1420282801198672000","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"50635860"},{"@type":"NRID","@value":"1000050635860"},{"@type":"NRID","@value":"9000243581319"},{"@type":"NRID","@value":"9000006935262"},{"@type":"NRID","@value":"9000387481660"},{"@type":"NRID","@value":"9000346962572"},{"@type":"NRID","@value":"9000311052110"},{"@type":"NRID","@value":"9000257692397"},{"@type":"NRID","@value":"9000412004913"},{"@type":"NRID","@value":"9000403162027"},{"@type":"NRID","@value":"9000396102026"},{"@type":"NRID","@value":"9000262375150"},{"@type":"NRID","@value":"9000356916031"},{"@type":"NRID","@value":"9000402386291"},{"@type":"NRID","@value":"9000415414002"},{"@type":"NRID","@value":"9000404829133"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/7000006965"}],"foaf:name":[{"@language":"en","@value":"Kira Akifumi"}],"jpcoar:affiliationName":[{"@language":"en","@value":"Gunma University"}]},{"@id":"https://cir.nii.ac.jp/crid/1420564276175112192","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"50410759"},{"@type":"NRID","@value":"1000050410759"},{"@type":"NRID","@value":"9000243581320"},{"@type":"NRID","@value":"9000309167858"},{"@type":"NRID","@value":"9000396165479"},{"@type":"NRID","@value":"9000346962573"},{"@type":"NRID","@value":"9000257692398"},{"@type":"NRID","@value":"9000341535067"},{"@type":"NRID","@value":"9000404471428"},{"@type":"NRID","@value":"9000389954863"},{"@type":"NRID","@value":"9000403545943"},{"@type":"NRID","@value":"9000313630129"},{"@type":"NRID","@value":"9000246810565"},{"@type":"NRID","@value":"9000262375151"},{"@type":"NRID","@value":"9000356916032"},{"@type":"NRID","@value":"9000391769670"},{"@type":"NRID","@value":"9000391770682"},{"@type":"NRID","@value":"9000402386292"},{"@type":"NRID","@value":"9000391774245"},{"@type":"NRID","@value":"9000396146433"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/inakawa"}],"foaf:name":[{"@language":"en","@value":"Inakawa Keisuke"}],"jpcoar:affiliationName":[{"@language":"en","@value":"Akita Prefectural University"}]},{"@id":"https://cir.nii.ac.jp/crid/1420564276187094656","@type":"Researcher","personIdentifier":[{"@type":"KAKEN_RESEARCHERS","@value":"60295003"},{"@type":"NRID","@value":"1000060295003"},{"@type":"NRID","@value":"9000262375145"},{"@type":"NRID","@value":"9000404116846"},{"@type":"NRID","@value":"9000014318884"},{"@type":"NRID","@value":"9000018316531"},{"@type":"NRID","@value":"9000237944323"},{"@type":"NRID","@value":"9000404116848"},{"@type":"NRID","@value":"9000412078357"},{"@type":"NRID","@value":"9000285484615"},{"@type":"NRID","@value":"9000386438049"},{"@type":"NRID","@value":"9000350648399"},{"@type":"NRID","@value":"9000403162026"},{"@type":"NRID","@value":"9000023749786"},{"@type":"NRID","@value":"9000319058292"},{"@type":"NRID","@value":"9000402386293"},{"@type":"NRID","@value":"9000002764379"},{"@type":"NRID","@value":"9000408681535"},{"@type":"RESEARCHMAP","@value":"https://researchmap.jp/read0189070"}],"foaf:name":[{"@language":"en","@value":"Fujita Toshiharu"}],"jpcoar:affiliationName":[{"@language":"en","@value":"Kyushu Institute of Technology"}]}],"publication":{"publicationIdentifier":[{"@type":"PISSN","@value":"04534514"},{"@type":"LISSN","@value":"04534514"},{"@type":"EISSN","@value":"21888299"},{"@type":"NDL_BIB_ID","@value":"000000126514"},{"@type":"ISSN","@value":"04534514"},{"@type":"NCID","@value":"AA00703935"}],"prism:publicationName":[{"@language":"ja","@value":"日本オペレーションズ・リサーチ学会論文誌"},{"@language":"en","@value":"Journal of the Operations Research Society of Japan"},{"@language":"ja","@value":"JORSJ"},{"@language":"en","@value":"JORSJ"}],"dc:publisher":[{"@language":"en","@value":"The Operations Research Society of Japan"},{"@language":"ja","@value":"公益社団法人 日本オペレーションズ・リサーチ学会"}],"prism:publicationDate":"2019-04-25","prism:volume":"62","prism:number":"2","prism:startingPage":"64","prism:endingPage":"82"},"reviewed":"false","dcterms:accessRights":"http://purl.org/coar/access_right/c_abf2","url":[{"@id":"https://kyutech.repo.nii.ac.jp/records/6086"},{"@id":"http://id.ndl.go.jp/bib/029632872"},{"@id":"https://ndlsearch.ndl.go.jp/books/R000000004-I029632872"},{"@id":"https://www.jstage.jst.go.jp/article/jorsj/62/2/62_64/_pdf"},{"@id":"http://hdl.handle.net/10228/00007296"}],"availableAt":"2019-04-25","foaf:topic":[{"@id":"https://cir.nii.ac.jp/all?q=Dynamic%20programming","dc:title":"Dynamic programming"},{"@id":"https://cir.nii.ac.jp/all?q=OR%20in%20sports","dc:title":"OR in sports"},{"@id":"https://cir.nii.ac.jp/all?q=Markov%20perfect%20equilibrium","dc:title":"Markov perfect equilibrium"},{"@id":"https://cir.nii.ac.jp/all?q=advantage%20of%20the%20last-batting%20team","dc:title":"advantage of the last-batting team"},{"@id":"https://cir.nii.ac.jp/all?q=optimal%20lineup","dc:title":"optimal lineup"}],"dcterms:subject":[{"subjectScheme":"NDC","notation":[{"@value":"548"}]},{"subjectScheme":"Other","notation":[{"@value":"Dynamic programming"}]},{"subjectScheme":"Other","notation":[{"@value":"OR in sports"}]},{"subjectScheme":"Other","notation":[{"@value":"Markov perfect equilibrium"}]},{"subjectScheme":"Other","notation":[{"@value":"advantage of the last-batting team"}]},{"subjectScheme":"Other","notation":[{"@value":"optimal lineup"}]}],"project":[{"@id":"https://cir.nii.ac.jp/crid/1040000781839471488","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"15K01193"},{"@type":"JGN","@value":"JP15K01193"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-15K01193/"}],"notation":[{"@language":"ja","@value":"大規模救急車シミュレータの開発とそれを用いた救急車の最適配置実験"},{"@language":"en","@value":"Development of a large-scale ambulance simulator and ambulance optimal location experiments"}]},{"@id":"https://cir.nii.ac.jp/crid/1040000782017709056","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"19K04882"},{"@type":"JGN","@value":"JP19K04882"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-19K04882/"}],"notation":[{"@language":"ja","@value":"フレキシブルな大規模救急車シミュレータの開発と政策応用のための数値実験"},{"@language":"en","@value":"Development of a Flexible Large-Scale Ambulance Simulator and Numerical Experiments for Policy Application"}]},{"@id":"https://cir.nii.ac.jp/crid/1040282256821177728","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"15K05004"},{"@type":"JGN","@value":"JP15K05004"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-15K05004/"}],"notation":[{"@language":"ja","@value":"ノンシリアル動的計画の新展開"},{"@language":"en","@value":"New development of nonserial dynamic programming"}]},{"@id":"https://cir.nii.ac.jp/crid/1040282256947543552","@type":"Project","projectIdentifier":[{"@type":"KAKEN","@value":"17K12644"},{"@type":"JGN","@value":"JP17K12644"},{"@type":"URI","@value":"https://kaken.nii.ac.jp/grant/KAKENHI-PROJECT-17K12644/"}],"notation":[{"@language":"ja","@value":"動的最適化による大規模マルコフゲームの求解と社会システムデザイン"},{"@language":"en","@value":"Dynamic Optimization for Solving Large-Scale Markov Games and Social System Design"}]}],"relatedProduct":[{"@id":"https://cir.nii.ac.jp/crid/1360011145568702720","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"The variance of discounted Markov decision processes"}]},{"@id":"https://cir.nii.ac.jp/crid/1360292618945355392","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Optimal threshold probability and expectation in semi-Markov decision processes"}]},{"@id":"https://cir.nii.ac.jp/crid/1360567182242236544","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Threshold probability of non-terminal type in finite horizon Markov decision processes"}]},{"@id":"https://cir.nii.ac.jp/crid/1360567186114362624","@type":"Article","resourceType":"学術雑誌論文(journal article)","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"AN APPLICATION OF A DISCRETE FIXED POINT THEOREM TO A GAME IN EXPANSIVE FORM"}]},{"@id":"https://cir.nii.ac.jp/crid/1360574094435111296","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"11. Extensive Games and the Problem of Information"}]},{"@id":"https://cir.nii.ac.jp/crid/1360574095032793600","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Minimizing a Threshold Probability in Discounted Markov Decision Processes"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855568803162624","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Dynamic Programming"}]},{"@id":"https://cir.nii.ac.jp/crid/1360855569244751232","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Target-level criterion in Markov decision processes"}]},{"@id":"https://cir.nii.ac.jp/crid/1361137045501899776","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Time Consistent Dynamic Risk Measures"}]},{"@id":"https://cir.nii.ac.jp/crid/1361418519570535040","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"An Offensive Earned-Run Average for Baseball"}]},{"@id":"https://cir.nii.ac.jp/crid/1361699995184455936","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Optimal threshold probability in undiscounted Markov decision processes with a target set"}]},{"@id":"https://cir.nii.ac.jp/crid/1361699996293797504","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Stochastic Target Hitting Time and the Problem of Early Retirement"}]},{"@id":"https://cir.nii.ac.jp/crid/1362825893429332224","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Minimizing Risk Models in Markov Decision Processes with Policies Depending on Target Values"}]},{"@id":"https://cir.nii.ac.jp/crid/1362825895892609920","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Stochastic Games"}]},{"@id":"https://cir.nii.ac.jp/crid/1363107368375189120","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"A Markov Chain Approach to Baseball"}]},{"@id":"https://cir.nii.ac.jp/crid/1363388843912129920","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"In Search of the \"Last-Ups\" Advantage in Baseball: A Game-Theoretic Approach"}]},{"@id":"https://cir.nii.ac.jp/crid/1363388844271755904","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Optimal policy for minimizing risk models in Markov decision processes"}]},{"@id":"https://cir.nii.ac.jp/crid/1363670318879112960","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Modified offensive earned-run average with steal effect for baseball"}]},{"@id":"https://cir.nii.ac.jp/crid/1364233270667612288","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@value":"Modelling a baseball game to optimise pitcher substitution strategies incorporating handedness of players"}]},{"@id":"https://cir.nii.ac.jp/crid/1390282679087043328","@type":"Article","relationType":["references"],"jpcoar:relatedTitle":[{"@language":"en","@value":"A MARKOV CHAIN APPROACH TO OPTIMAL PINCH HITTING STRATEGIES IN A DESIGNATED HITTER RULE BASEBALL GAME"},{"@language":"ja-Kana","@value":"Markov Chain Approach to Optimal Pinch Hitting Strategies in a Designated Hitter Rule Baseball Game"}]}],"dataSourceIdentifier":[{"@type":"JALC","@value":"oai:japanlinkcenter.org:2007185559"},{"@type":"IRDB","@value":"oai:irdb.nii.ac.jp:01216:0004078707"},{"@type":"NDL_SEARCH","@value":"oai:ndlsearch.ndl.go.jp:R000000004-I029632872"},{"@type":"CROSSREF","@value":"10.15807/jorsj.62.64"},{"@type":"CIA","@value":"130007636494"},{"@type":"KAKEN","@value":"PRODUCT-22723959"},{"@type":"KAKEN","@value":"PRODUCT-22147135"},{"@type":"KAKEN","@value":"PRODUCT-22003129"},{"@type":"KAKEN","@value":"PRODUCT-23019637"},{"@type":"OPENAIRE","@value":"doi_dedup___::17fa31882f031085f7fa5de22799b90e"}]}