Cyclic games and an algorithm to find minimax cycle means in directed graphs

Cyclic games and an algorithm to find minimax cycle means in directed graphs

0.00 Avg rating0 Votes
Article ID: iaor19921444
Country: United Kingdom
Volume: 28
Start Page Number: 85
End Page Number: 91
Publication Date: Feb 1988
Journal: USSR Computational Mathematics and Mathematical Physics
Authors: ,
Keywords: game theory
Abstract:

An algorithm is described that finds optimal stationary strategies in dynamic two-person conflicts with perfect information, deterministic transitions, finite sets of positions, and time-averaged limiting integral payoff.

Reviews

Required fields are marked *. Your email address will not be published.