Toward the Synthesis of Solutions of Dynamic Games

摘要: Publisher Summary The advent of computers has allowed the building experience through simulation competition and opened possibility evaluating conflicts numerically. latter brings logic mathematics to bear on important events, which were intuitively evaluated. A branch mathematics, called game theory, is concerned with finding solutions mathematical models conflict, competition, cooperation. approximate numerical methods are most reasonable approach use for real situations. This chapter presents a conversion situation programming problem, demonstrates that even simple situations, exact analytical difficult or impossible obtain. principle optimality method dual cones brought together extended such it possible synthesize an class dynamic games. games viewed as sequence parametrized static games, each can be solved problem.