Related Experiment Video
Updated: Jul 7, 2025

Spatial Multiobjective Optimization of Agricultural Conservation Practices using a SWAT Model and an Evolutionary Algorithm
Published on: December 9, 2012
Game of strokes: Optimal & conversion strategy algorithms with simulations & application
David Iheke Okorie1,2,3,4,5, Joel Miworse Gnatchiglo5
1Hangzhou City University (HZCU), Hangzhou, China.
Abstract:
Strategic decision-making for sequential move games requires rationality and continuity of rationality to guarantee maximum payoffs at all nodes/stages/levels. Rationality and continuity of rationality in a player's behaviour are not often observed and/or maintained thus, leading to less optimal outcomes. More so, the belief in an opponent's rationality, on the other hand, co-determines the level of effort a player employs while making strategic decisions. Given irrationality and discontinuity of rationality in a sequential move game with mover advantages, there are strategic steps (algorithms) to convert and/or maintain the mover advantages of an irrational player. In this paper, the conversion strategy algorithms, as well as the optimal strategy algorithms, are developed using the Beta Limit Sum (BLS) strategy model and the game of strokes. The simulation exercises confirm that the BLS strategy model is an optimal solution for the finite sequential game of strokes. One of the key applications of these strategies is that of resource economics like environmental resources (clean water, air & land). These are public goods, as such, the optimal strategy entails that the community cooperates (as one entity) and takes the same actions or strategy to maintain a healthy and clean state of the communal environmental resources.
Related Concept Videos
Trial and Error and Algorithm
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Statgraphics
Properties of the z-Transform I
SFG Algebra
Each node in an SFG corresponds to a variable, and the interactions between nodes are represented by branches with associated gains. When multiple branches lead into a node, the value at that node is the sum of the...

