ON COMPUTATIONAL COMPLEXITY OF HIERARCHICAL OPTIMIZATION

DOI10.1142/S0129054102001369zbMath1066.90107MaRDI QIDQ3021976

Zhibin Sun, Wei-Jia Jia

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) (n)-person games, (n>2) (91A06) Complexity and performance of numerical algorithms (65Y20)

Cites Work

• Decision-making by hierarchies of discordant agents
• The polynomial hierarchy and a simple model for competitive analysis

This page was built for publication: ON COMPUTATIONAL COMPLEXITY OF HIERARCHICAL OPTIMIZATION