The polynomial hierarchy and a simple model for competitive analysis
- 1 June 1985
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 32 (2) , 146-164
- https://doi.org/10.1007/bf01586088
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Stackelberg-Nash-Cournot Equilibria: Characterizations and ComputationsOperations Research, 1983
- On two-level optimizationIEEE Transactions on Automatic Control, 1982
- An explicit solution to the multi-level programming problemComputers & Operations Research, 1982
- A linear two-level programming problemComputers & Operations Research, 1982
- Sequential Location among Firms with ForesightThe Bell Journal of Economics, 1977
- Complete sets and the polynomial-time hierarchyTheoretical Computer Science, 1976
- The polynomial-time hierarchyTheoretical Computer Science, 1976
- Relativizations of the $\mathcal{P} = ?\mathcal{NP}$ QuestionSIAM Journal on Computing, 1975
- On the Stackelberg strategy in nonzero-sum gamesJournal of Optimization Theory and Applications, 1973
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972