The aim of this paper is to present, in the scope of game theory, a new games representation: the code form, consisting of a table which contains the whole information, without any suppression or “adulteration “with regards to the game. After the theoretical description, its application is exemplified in solving the problem of selecting a candidate up to his/her acceptance trough game theory. The originality this paper proposes is how this problem will be approached: it will be treated as a single game which is made up of two parts, going as far as to state that the payoffs in the first part of the game will be the mediators of the second part of the game, instead of using the stochastic dynamic programming approach. The solution of the problem using stochastic dynamic programming is also presented to highlight empirically the parallelism between the two modes of resolution.

This work is financed by national funds through FCT - Fundação para a Ciência e Tecnologia, I.P., under the projects UID/MULTI/4466/2016 and UID/MULTI/04016/ 2016. Furthermore, the authors thank the Instituto Universitário de Lisboa and ISTAR-IUL, and Ins

code form,game theory,stochastic dynamic programming,two-part game

• Matemáticas - Ciências Naturais
• Ciências da Computação e da Informação - Ciências Naturais
• Outras Ciências Sociais - Ciências Sociais