Efficient correct planning with two-way information flows (Q1112723)
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: Efficient correct planning with two-way information flows |
scientific article; zbMATH DE number 4079159
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient correct planning with two-way information flows |
scientific article; zbMATH DE number 4079159 |
Statements
Efficient correct planning with two-way information flows (English)
0 references
1988
0 references
We consider the synthesis of planning laws when a scarce resource is allocated on the basis of requirements information reported by the production divisions. Correct planning laws are laws that ensure the existence of optimal divisional strategies for choosing the reported information. We investigate the case when the strategies satisfy the most general set of game-theoretical optimality principles. We derive necessary conditions of efficiency of planning laws, which makes it possible to simplify the synthesis problem.
0 references
complex organization
0 references
synthesis of planning laws
0 references
scarce resource
0 references
Correct planning laws
0 references
optimal divisional strategies
0 references
0.8120691776275635
0 references
0.7956684231758118
0 references
0.7664812803268433
0 references
0.7641738057136536
0 references
0.7483224272727966
0 references
