The Complexity of Stackelberg Pricing Games

2025-11-07

AI Summary

This paper resolves the long-standing open problem concerning the computational complexity of Stackelberg pricing games: specifically, whether such games are Σ₂ᵖ-complete when followers solve NP-complete combinatorial optimization problems—including Knapsack, TSP, Vertex Cover, Clique, and Subset Sum. The authors develop a unified bilevel programming framework and employ techniques from computational complexity theory, particularly polynomial-time reductions, within a meta-theorem setting. They establish, for the first time, rigorous Σ₂ᵖ-completeness results for Stackelberg pricing games associated with over 50 classical NP-complete problems. This characterization precisely locates the problem’s complexity at the second level of the polynomial hierarchy. Beyond settling a foundational question in algorithmic game theory, the work provides a general-purpose criterion for determining the complexity of higher-order strategic interactions and bilevel optimization problems, thereby advancing the interface between computational game theory and structural complexity theory.

Technology Category

• Game Theory and Economic Paradigms: Mechanism Design
• Multiagent Systems: Mechanism Design
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning

Application Category

• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems
• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Security and Privacy: Large-scale security measurements

Abstract

We consider Stackelberg pricing games, which are also known as bilevel pricing problems, or combinatorial price-setting problems. This family of problems consists of games between two players: the leader and the follower. There is a market that is partitioned into two parts: the part of the leader and the part of the leader's competitors. The leader controls one part of the market and can freely set the prices for products. By contrast, the prices of the competitors'products are fixed and known in advance. The follower, then, needs to solve a combinatorial optimization problem in order to satisfy their own demands, while comparing the leader's offers to the offers of the competitors. Therefore, the leader has to hit the intricate balance of making an attractive offer to the follower, while at the same time ensuring that their own profit is maximized. Pferschy, Nicosia, Pacifici, and Schauer considered the Stackelberg pricing game where the follower solves a knapsack problem. They raised the question whether this problem is complete for the second level of the polynomial hierarchy, i.e., $Sigma^p_2$-complete. The same conjecture was also made by B""ohnlein, Schaudt, and Schauer. In this paper, we positively settle this conjecture. Moreover, we show that this result holds actually in a much broader context: The Stackelberg pricing game is $Sigma^p_2$-complete for over 50 NP-complete problems, including most classics such as TSP, vertex cover, clique, subset sum, etc. This result falls in line of recent meta-theorems about higher complexity in the polynomial hierarchy by Gr""une and Wulf.

Problem

• Determining the computational complexity of Stackelberg pricing games
• Proving these games are Σp2-complete for NP-complete follower problems
• Settling conjectures about complexity across over 50 classic problems

Innovation

• Proves Stackelberg pricing game is Σp2-complete
• Extends complexity result to 50 NP-complete problems
• Settles open conjecture about polynomial hierarchy completeness