Strategic Form Games on Digraphs
Valeriu Ungureanu · Smart innovation, systems and technologies · 2018
The chapter deals with strategic form games on digraphs, and examines maximin solution concepts based on different types of digraph substructures Ungureanu (Computer Science Journal of Moldova 6 3(18): 313–337, 1998, [ 1 ]), Ungureanu (ROMAI Journal 12(1): 133–161, 2016, [ 2 ]). Necessary and sufficient conditions for maximin solution existence in digraph matrix games with pure strategies are formulated and proved. Some particular games are considered. Algorithms for finding maximin substructures are suggested. Multi-player simultaneous games and dynamical/hierarchical games on digraphs are considered too. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.