On an approach to solving a special type of dynamic programming problem (Q2773636)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On an approach to solving a special type of dynamic programming problem |
scientific article; zbMATH DE number 1710261
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On an approach to solving a special type of dynamic programming problem |
scientific article; zbMATH DE number 1710261 |
Statements
24 February 2002
0 references
cost function
0 references
On an approach to solving a special type of dynamic programming problem (English)
0 references
The authors propose an approach to solving a special type of dynamic programming problem which arise from a problem of finding a counter-strategy for the second player in a noncooperative game with discrimination and with a goal function of a special type. A method of finding such a counter-strategy is given which is simpler than the general method of dynamic programming.
0 references
