Abstract:
The paper describes adaptive approach to a single-criterion decision making problem with limited uncertainty. A special form of the penalty function is introduced and it is shown that with sufficiently weak constraints a Narendra–Shapiro automaton find an optimal state (decision) in pure strategies as $t\to\infty$.