Polynomial time algorithm for solving cyclic games
The problem of finding the value and optimal strategies of players in cyclic games is studied. A polynomial time algorithm for solving cyclic games is proposed.
Main Author: | Dmitrii Lozovanu |
---|---|
Format: | Article |
Language: | English |
Published: |
Vladimir Andrunachievici Institute of Mathematics and Computer Science
2003-10-01
|
Series: | Computer Science Journal of Moldova |
Online Access: | http://www.math.md/files/csjm/v11-n2/v11-n2-(pp107-123).pdf |
Similar Items
-
Polynomial Time Algorithm for Determining Max-Min Paths in Networks and Solving Zero Value Cyclic Games
by: Dmitrii D. Lozovanu
Published: (2005-10-01) -
Game-Theoretic Approach for Solving Multiobjective Flow Problems on Networks
by: Maria A. Fonoberova, et al.
Published: (2005-10-01) -
The minimum cost multicommodity flow problem in dynamic networks and an algorithm for its solving
by: Maria A. Fonoberova, et al.
Published: (2005-05-01) -
Algorithms for solving discrete control problems on networks
by: A. Iusiumbeli, et al.
Published: (2002-11-01) -
PARALLEL ALGORITHM TO SOLVING 2D BLOCK-CYCLIC PARTITIONED BIMATRIX GAMES
by: USM ADMIN
Published: (2021-03-01)