scholarly journals Application of Game Theory and Markov Chains on English Premier League (EPL) Scorelines Analysis

2021 ◽  
pp. 38-50
Author(s):  
Christogonus Ifeanyichukwu Ugoh ◽  
Chinwendu Alice Uzuke ◽  
Obiora-Ilouno Happiness Onyebuchi ◽  
Obi-Okpala Chinelo Ijeoma ◽  
Orji gabriel Oyo ◽  
...  
Keyword(s):  
Game Theory ◽  
Linear Programming ◽  
Markov Chain ◽  
Markov Chains ◽  
Optimal Strategy ◽  
Optimal Strategies ◽  
Premier League ◽  
Markov Chain Method ◽  
English Premier League

The aim of this paper is to obtain the optimal strategies of two competitive players using Game Theorem and to make future predictions of games using Markov Chains involving the EPL. All the teams that have participated since 2005/2006 EPL season to EPL 2019/2020 season were considered and the method of proportion of wins was used to select five best teams. Linear programming was employed to select the optimal strategies, while the predictions for seasons 2020/2021 to 2023/2024 are obtained by Markov chain method. The results obtained revealed that Man U is the optimal strategy for Player A, and that Player A has to choose Man U to maximize his profit, meanwhile, Chelsea is the optimal strategy for Player B and he has to choose Chelsea to minimize his loss. The findings of the results also revealed that for Man U or Chelsea to win their home games, it will depend on their current home winning against the team they are playing with.

scholarly journals Improving the criteria for choosing the strategies in management by geotechnical systems

2019 ◽  
Vol 109 ◽  
pp. 00048
Author(s):  
Yevhen Lapshyn ◽  
Robert Molchanov ◽  
Borys Blyuss ◽  
Nataliia Osadcha
Keyword(s):  
Game Theory ◽  
Optimal Strategy ◽  
Optimal Strategies ◽  
Mineral Deposits ◽  
Underground Space ◽  
Infrastructure Development ◽  
Main Indicator ◽  
Geological Conditions ◽  
Geological Faults

The conclusion has been made about the necessity to choose the optimal strategies for management by geotechnical systems, based on the analysis of geological faults, which are the main indicator of the mining and geological conditions that characterize the mineral deposits, as well as on the parameters for the infrastructure development of the underground space. The methodological peculiarity of solving the problems set is the use of game theory with modified criteria of Wald, maximax and Savage, since the manifestation of specific geological faults is probabilistic in nature. When choosing the optimal strategy, the average linear deviations of gains or risks are taken into account.

Optimal Strategy of Social Responsibility and Quality Effort in Service Supply Chain with Quality Preference

2018 ◽  
Vol 35 (03) ◽  
pp. 1850018 ◽  
Author(s):  
Cui-Hua Zhang ◽  
Peng Xing ◽  
Jin Li
Keyword(s):  
Game Theory ◽  
Supply Chain ◽  
Social Responsibility ◽  
Numerical Simulations ◽  
Optimal Strategy ◽  
Mathematical Reasoning ◽  
Optimal Strategies ◽  
Utility Functions ◽  
Decision Models ◽  
Service Supply Chain

We investigate the optimal strategy of service supply chain (SSC) including one integrator and two suppliers under a two-layer game structure. Service integrator decides social responsibility and service price, while the two service suppliers with quality preference determine their quality efforts, respectively. By analyzing the two-layer game structure and eight different scenarios of decision models (i.e., CD, DD, ICD, IDD, ISD, SCD, SDD, and SSD), we establish members’ utility functions under different decision models. Meanwhile, based on game theory, the optimal strategies of SSC are obtained. Mathematical reasoning and numerical simulations show that, firstly, quality preference has impact on optimal strategy and members’ utilities under different constraints. Secondly, utility of supply chain with integrator as a leader is greater than the case with suppliers as the leader.

scholarly journals English Premier League Scoreline Analysis: A Stochastic and Game Theory Approach

2021 ◽  
Vol 10 (3) ◽  
pp. 136
Author(s):  
Ngonadi Lilian Oluebube ◽  
Ezemma George Chijioke ◽  
Etaga Harrison Oghenekevwe ◽  
Ugoh Christogonus Ifeanyichukwu
Keyword(s):  
Game Theory ◽  
Theory Approach ◽  
Premier League ◽  
English Premier League

UGLEO: A WEB BASED INTELLIGENCE CHATBOT FOR STUDENT ADMISSION PORTAL USING MEGAHAL STYLE

2018 ◽  
Vol 23 (3) ◽  
pp. 175-191
Author(s):  
Anneke Annassia Putri Siswadi ◽  
Avinanta Tarigan
Keyword(s):  
Markov Chain ◽  
Natural Language Processing ◽  
Natural Language ◽  
Language Processing ◽  
Information Need ◽  
Web Based ◽  
Markov Chain Method ◽  
Information Center

To fulfill the prospective student's information need about student admission, Gunadarma University has already many kinds of services which are time limited, such as website, book, registration place, Media Information Center, and Question Answering’s website (UG-Pedia). It needs a service that can serve them anytime and anywhere. Therefore, this research is developing the UGLeo as a web based QA intelligence chatbot application for Gunadarma University's student admission portal. UGLeo is developed by MegaHal style which implements the Markov Chain method. In this research, there are some modifications in MegaHal style, those modifications are the structure of natural language processing and the structure of database. The accuracy of UGLeo reply is 65%. However, to increase the accuracy there are some improvements to be applied in UGLeo system, both improvement in natural language processing and improvement in MegaHal style.

Asymptotic behaviour of sample weighted circuits representing recurrent Markov chains

1990 ◽  
Vol 27 (03) ◽  
pp. 545-556 ◽  
Author(s):  
S. Kalpazidou
Keyword(s):  
Markov Chain ◽  
Markov Chains ◽  
Asymptotic Behaviour ◽  
Probabilistic Interpretation ◽  
Stationary Markov Chain

The asymptotic behaviour of the sequence (𝒞 n (ω), wc,n (ω)/n), is studied where 𝒞 n (ω) is the class of all cycles c occurring along the trajectory ωof a recurrent strictly stationary Markov chain (ξ n ) until time n and wc,n (ω) is the number of occurrences of the cycle c until time n. The previous sequence of sample weighted classes converges almost surely to a class of directed weighted cycles (𝒞∞, ω c ) which represents uniquely the chain (ξ n ) as a circuit chain, and ω c is given a probabilistic interpretation.

scholarly journals Optimal, near-optimal, and robust epidemic control

2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Dylan H. Morris ◽  
Fernando W. Rossine ◽  
Joshua B. Plotkin ◽  
Simon A. Levin
Keyword(s):  
Robust Control ◽  
Disease Control ◽  
Epidemic Model ◽  
Optimal Strategy ◽  
Policy Design ◽  
Optimal Strategies ◽  
Economic Costs ◽  
Short Period ◽  
Intervention Policy ◽  
Pharmaceutical Interventions

AbstractIn the absence of drugs and vaccines, policymakers use non-pharmaceutical interventions such as social distancing to decrease rates of disease-causing contact, with the aim of reducing or delaying the epidemic peak. These measures carry social and economic costs, so societies may be unable to maintain them for more than a short period of time. Intervention policy design often relies on numerical simulations of epidemic models, but comparing policies and assessing their robustness demands clear principles that apply across strategies. Here we derive the theoretically optimal strategy for using a time-limited intervention to reduce the peak prevalence of a novel disease in the classic Susceptible-Infectious-Recovered epidemic model. We show that broad classes of easier-to-implement strategies can perform nearly as well as the theoretically optimal strategy. But neither the optimal strategy nor any of these near-optimal strategies is robust to implementation error: small errors in timing the intervention produce large increases in peak prevalence. Our results reveal fundamental principles of non-pharmaceutical disease control and expose their potential fragility. For robust control, an intervention must be strong, early, and ideally sustained.

On the absorption probabilities and mean time for absorption for discrete Markov chains

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Nikolaos Halidias
Keyword(s):  
Markov Chain ◽  
Random Walk ◽  
Markov Chains ◽  
Generating Function ◽  
Discrete Time ◽  
Probability Generating Function ◽  
The Mean ◽  
Mean Time ◽  
Absorption Probabilities

Abstract In this note we study the probability and the mean time for absorption for discrete time Markov chains. In particular, we are interested in estimating the mean time for absorption when absorption is not certain and connect it with some other known results. Computing a suitable probability generating function, we are able to estimate the mean time for absorption when absorption is not certain giving some applications concerning the random walk. Furthermore, we investigate the probability for a Markov chain to reach a set A before reach B generalizing this result for a sequence of sets A 1 , A 2 , … , A k {A_{1},A_{2},\dots,A_{k}} .

Sign in / Sign up

Export Citation Format

Share Document