On a solution of the discrete resource allocation game

D. W. Blackett, “Some Blotto Games,” Nav. Res. Logist. Quarterly 1(1), 55–60 (1954).

O. Gross and R. Wagner, A Continuous Colonel Blotto Game U. S. Air Force Project RAND (Research Memorandum-408, 1950).

A. A. Vasin and V. V. Morozov, Game Theory (MAKS, Moscow, 2008) [in Russian].

V. F. Ogaryshev, “Composite strategies in a generalization of the Gross problem,” Zh. Vychisl. Mat. Mat. Fiz. 13(1), 59–70 (1973).

E. M. L. Beale and G. P. M. Heselden, “An approximate method of solving Blotto games,” Nav. Res. Logist. Quarterly 9(2), 65–79 (1962).

M. Dresher, Games of Strategy: Theory and Applications (Prentice-Hall, Englewood Cliffs, NJ, 1961; Sovetskoe Radio, Moscow, 1964).

A. A. Vasin, P. S. Krasnoshchekov, and V. V. Morozov, Operations Research (Akademiya, Moscow, 2008) [in Russian].

P. H. Randolph and G. E. Swinson, “The discrete max-min problem,” Nav. Res. Logist. Quarterly 16, 309–314 (1969).

T. M. Green, “Diophantine equation with non-negative parameters and solutions,” Fibonacci Quarterly 6, 177–184 (1968).

K. D. Shalbuzov and V. V. Morozov, “One modification of gomory’s algorithm,” Mos. Univ. Comput. Math. Cybern. 36, 1–7 (2012).