Multistage vector minimax
From MaRDI portal
The problem of formalization of the guaranteed value of a multistage vector minimax is considered for problems of multistage decision making under uncertainty, in particular, for multiuser network optimization problems. A method is suggested for parametrizing this value and minimizing and guaranteeing strategies that realize it by means of inverse logical convolution. The approximating properties of this convolution are validated.
Recommendations
- An inverse logical convolution for a multiple vector minimax problem
- Multicriteria decision making under uncertainty
- An inverse logical convolution in the problem of the search for a multiple vector minimax
- Parametrization of the value of a vector maximinimax by means of an inverse logical convolution
- Multicriterial maximinimax
Cited in
(7)- Vector minimax with dependent variables
- An inverse logical convolution for a multiple vector minimax problem
- Approximation properties of the inverse logical convolution in the vector maximinimax problem
- Multicriteria competitive games as models in operations research
- Approximation of the set of sharp estimates for the vector of criteria in the problem of dynamic decision making under uncertainty
- Multicriterial maximinimax
- Applying the linear scalarization in multicriteria maximin problems
This page was built for publication: Multistage vector minimax
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608250)
