caa a22 4500 475741544 CHVBK 20180406123500.0 cr unu---uuuuu 170329e20000601xx s 000 0 eng 10.1007/BF02675631 doi (NATIONALLICENCE)springer-10.1007/BF02675631 Lebedev V. Volgograd State University, USSR aut Stationary equilibria in cyclic games: Search and structure [Elektronische Daten] [V. Lebedev] The existence of optimal stationary strategies for a cyclic game played on the vertices of a bipartite graph up to the first cycle with the payoff of one player to the other equaling the sum of the maximal and minimal local payoffs on this cycle is proved. This result implies that the problem belongs to the class NP ∩ co-NP; -a polynomial algorithm that yields optimal strategies for ergodic extensions of matrix games is given. Kluwer Academic/Plenum Publishers, 2000 cyclic games nationallicence optimal stationary strategies nationallicence stochastic games nationallicence bipartite graphs nationallicence ergodic partitions nationallicence computational complexity nationallicence Mathematical Notes Kluwer Academic Publishers-Plenum Publishers 67/6(2000-06-01), 771-777 0001-4346 67:6<771 2000 67 11006 https://doi.org/10.1007/BF02675631 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02675631 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Lebedev V. Volgograd State University, USSR aut NATIONALLICENCE 773 0- Mathematical Notes Kluwer Academic Publishers-Plenum Publishers 67/6(2000-06-01), 771-777 0001-4346 67:6<771 2000 67 11006 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer