Artificial intelligence

Scientific journal

ISSN 2710-1673

ONLINE: ISSN 2710-1681

Search by:

Year of publication
Author name
Paper title

Comparison of methods for solving game tasks: numerical experiments

Iemets O.1, Olhovskiy D.1, Olhovskaya O.1
1 Poltava University of economics and trade

Full text (PDF)

UDC: 519.83
Publication Language: Russian
Stuc. intelekt. 2014; 19(1):47–56

Abstract: The paper presents the results of numerical experiments about practical effectiveness of the Brown- Robinson method and monotonic algorithm for matrix games in terms rate of convergence and exactness time outlay.

Keywords: numerical experiments, Brown-Robinson method, matrix games.

References:

  1. Yemets O. O. Study of mathematical models and methods of solving problems on permutations of thegaming type. Yemets O. O., Ustian N. Y. Kibernetika i sist. analiz (Ukraine), 2007, 6, pp. 103-114.
  2. Sadovskiy A.L. Monotone iterative algorithm for solving matrix games. A.L. Sadovskiy. RAS USSR,1978, vol. 238, № 3, pp. 538-540.
  3. Petrosyan L.A. Games theory. L.A. Petrosyan, N.A. Tzenkevich, E.A. Semina. Moscow, 1998, 304 p.
  4. Yemets O. O. Solving game problems on permutations. Yemets O. O., Ustian N. Y. Naukovі Visti NTUU"KPI" (Ukraine), 2007, 3, pp. 47-52.
  5. Yemets O. O. Solving some combinatorial optimization problems on arrangements and permutations of thegaming type. Yemets O. O., Ustian N. Y. Problemy upravleniia i informatiki (Ukraine), 2006, 3, pp. 37-47.
  6. Yemets O. O. Study of combinatorial optimization problems of the gaming type on arrangements. YemetsO. O., Ustian N. Y. Problemy upravleniia i informatiki (Ukraine), 2007, 1, pp. 26-36.
  7. Yemets O. O. One iterative method of solving game problems on permutations. Yemets O. O., Ustian N.Y. Naukovі Visti NTUU "KPI" (Ukraine), 2008, 3, pp. 5-10.
  8. Yemets O. O. Games with combinatorial restrictions. Yemets O. O., Ustian N. Y. Kibernetika i sist.analiz (Ukraine), 2008, 4, pp. 134-141.
  9. Yemets O. A. The iterative method of solving combinatorial optimization problems of the gaming type onarrangements. Yemets O. O., Olkhovska O. V. Problemy upravleniya i informatiki (Ukraine), 2011, 3, pp. 69-78.
  10. Yemets O. O. Solving combinatorial problems of the gaming type with permutations-restrictions of bothplayers: the iterative method. Yemets O. O., Olkhovska O. V. Systemni doslidzhennia ta informatsiinitekhnolohii (Ukraine), 4, pp. 80-93.
  11. Yemets O. O. Proof of convergence of the iterative method for solving combinatorial optimizationproblems of the gaming type on arrangements. Yemets O. O., Olkhovska O. V. Kibernetika i sist. analiz(Ukraine), 2013, 1, pp. 102-114.
  12. Julia Robinson An Iterative Method of Solving a Game / The Annals of Mathematics, Second Series,Vol. 54, No. 2 (Sep., 1951), pp. 296-301
  13. CurveExpert Software / Daniel G. Hyams. – 2013.

View full text (PDF)