On a Class of Optimization Problems with No “Efficiently Computable” Solution
- Authors: Gavrilovich M.R.1, Kreps V.L.1
-
Affiliations:
- National Research University Higher School of Economics
- Issue: Vol 215, No 6 (2016)
- Pages: 706-714
- Section: Article
- URL: https://journals.rcsi.science/1072-3374/article/view/237708
- DOI: https://doi.org/10.1007/s10958-016-2876-0
- ID: 237708
Cite item
Abstract
It is well known that large random structures may have nonrandom macroscopic properties. We give an example of nonrandom properties for a class of large optimization problems related to the computational problem MAXFLS= of calculating the maximum number of consistent equations in a given overdetermined system of linear equations. A problem of this kind is faced by a decision maker (an Agent) choosing means to protect a house from natural disasters. For this class we establish the following. There is no “efficiently computable” optimal strategy of the Agent. As the size of a random instance of the optimization problem goes to infinity, the probability that the uniform mixed strategy of the Agent is ε-optimal goes to one. Moreover, there is no “efficiently computable” strategy of the Agent that is substantially better for each instance of the optimization problem. Bibliography: 13 titles.
About the authors
M. R. Gavrilovich
National Research University Higher School of Economics
Author for correspondence.
Email: mishap@sdf.org
Russian Federation, St.Petersburg
V. L. Kreps
National Research University Higher School of Economics
Email: mishap@sdf.org
Russian Federation, St.Petersburg