Complementing the Linear-Programming Learning Experience with the Design and Use of Computerized Games: The Formula 1 Championship Game

by   Gerardo L. Febres, et al.

This document focuses on modeling a complex situations to achieve an advantage within a competitive context. Our goal is to devise the characteristics of games to teach and exercise non-easily quantifiable tasks crucial to the math-modeling process. A computerized game to exercise the math-modeling process and optimization problem formulation is introduced. The game is named The Formula 1 Championship, and models of the game were developed in the computerized simulation platform MoNet. It resembles some situations in which team managers must make crucial decisions to enhance their racing cars up to the feasible, most advantageous conditions. This paper describes the game's rules, limitations, and five Formula 1 circuit simulators used for the championship development. We present several formulations of this situation in the form of optimization problems. Administering the budget to reach the best car adjustment to a set of circuits to win the respective races can be an approach. Focusing on the best distribution of each Grand Prix's budget and then deciding how to use the assigned money to improve the car is also the right approach. In general, there may be a degree of conflict among these approaches because they are different aspects of the same multi-scale optimization problem. Therefore, we evaluate the impact of assigning the highest priority to an element, or another, when formulating the optimization problem. Studying the effectiveness of solving such optimization problems turns out to be an exciting way of evaluating the advantages of focusing on one scale or another. Another thread of this research directs to the meaning of the game in the teaching-learning process. We believe applying the Formula 1 Game is an effective way to discover opportunities in a complex-system situation and formulate them to finally extract and concrete the related benefit to the context described.


page 6

page 9

page 10

page 11

page 19

page 20

page 21


Characterizing the Decidability of Finite State Automata Team Games with Communication

In this paper we define a new model of limited communication for multipl...

Aspects of High-Rated Games

As the video game market grows larger, it becomes harder to stand out fr...

Who Will Win It? An In-game Win Probability Model for Football

In-game win probability is a statistical metric that provides a sports t...

The Road Less Travelled: Trying And Failing To Generate Walking Simulators

Automated game design is a rapidly growing area of research, yet many as...

Formula size games for modal logic and μ-calculus

We propose a new version of formula size game for modal logic. The game ...

Explaining Non-Bisimilarity in a Coalgebraic Approach: Games and Distinguishing Formulas

Behavioural equivalences can be characterized via bisimulation, modal lo...

Augmenting Operations Research with Auto-Formulation of Optimization Models from Problem Descriptions

We describe an augmented intelligence system for simplifying and enhanci...