An approach to solving antagonistic games with a large number of pure strategies of the players

N.G. Anishchenkova, I.B. Bolotin

Abstract


In this paper we consider one of the possible ways of finding the optimal mixed strategies for solving antagonistic games with a large number of pure strategies of
the players. It consists of two stages: computer simulation of the game for constructing hypotheses and proofs of theorems formulated on the basis of the hypothesis. To construct hypotheses we use one of the systems of computer mathematics.


Full Text:

PDF (Russian)

References


Allen R. Matematicheskaja jekonomija. – M.: Izdatel'stvo

inostrannoj literatury, 1963.

Afanas'ev M.Ju., Bagrinovskij K.A., Matjushok V.M.

Prikladnye zadachi issledovanija operacij: Ucheb. posobie. –

M.: INFRA-M, 2006.


Refbacks

  • There are currently no refbacks.


IT-EDU-2017   Servletsuite

ISSN: 2307-8162