Complexity of Unambiguous Problems in $Σ^P_2$

2025-10-21

AI Summary

This paper investigates the complexity of unambiguous problems within the second-level polynomial hierarchy, $mathbf{Sigma^P_2}$. It introduces the new complexity class $mathbf{USigma^P_2}$ and its syntactic subclasses $mathbf{PCW}$, $mathbf{PTW}$, and $mathbf{PMA}$, designed to precisely classify central problems in social choice and game theory—such as existence of dominant strategies and Condorcet winner determination. Using a formal framework based on unique existential verification relations $varphi(x,y)$, augmented with randomized techniques and structured reductions, the paper establishes that $mathbf{PCW}$ and $mathbf{PTW}$ are randomized polynomial-time equivalent to $mathbf{Delta^P_2}$, markedly below the $mathbf{Sigma^P_2}$-completeness of their ambiguous counterparts. It further proves strict containment relationships: $mathbf{Delta^P_2} subsetneq mathbf{USigma^P_2} subseteq mathbf{S^P_2}$. This work provides the first systematic characterization of how unambiguity induces a provable reduction in computational hardness.

Technology Category

• Game Theory and Economic Paradigms: Social Choice / Voting
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Reasoning under Uncertainty: Other Foundations of Reasoning under Uncertainty

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Economics, Online Markets and Human Computation: Fairness, privacy, and diversity in economic environments
• Web Mining and Content Analysis: Bridging structured and unstructured data

Abstract

The complexity class $f{Σ^P_2}$ comprises problems based on polynomial-time checkable binary relations $φ(x,y)$ in which we ask whether there exists $x$ such that for all $y$, $φ(x,y)$ holds. We let $f{UΣ^P_2}$ denote the subclass of unambiguous problems in $f{Σ^P_2}$, namely those whose yes-instances correspond with a unique choice of $x$. $f{UΣ^P_2}$ is unlikely to have complete problems, but we identify various syntactic subclasses associated with general properties of $φ$ that guarantee uniqueness. We use these to classify the complexity of problems arising in social choice and game theory, such as existence of (1) a dominating strategy in a game, (2) a Condorcet winner, (3) a strongly popular partition in hedonic games, and (4) a winner (source) in a tournament. We classify these problems, showing the first is $f{Δ^P_2}$-complete, the second and third are complete for a class we term $f{PCW}$ (Polynomial Condorcet Winner), and the fourth for a class we term $f{PTW}$ (Polynomial Tournament Winner). We define another unambiguous class, $f{PMA}$ (Polynomial Majority Argument), seemingly incomparable to $f{PTW}$ and $f{PCW}$. We show that with randomization, $f{PCW}$ and $f{PTW}$ coincide with $f{Δ^P_2}$, and $f{PMA}$ is contained in $f{Δ^P_2}$. Specifically, we prove: $f{Δ^P_2} subseteq f{PCW} subseteq f{PTW} subseteq f{S^P_2}$, and $f{coNP} subseteq f{PMA} subseteq f{S^P_2}$ (and it is known that $f{S^P_2}subseteq f{ZPP^{NP}} subseteq f{Σ^P_2} cap f{Π^P_2}$). We demonstrate that unambiguity can substantially reduce computational complexity by considering ambiguous variants of our problems, and showing they are $f{Σ^P_2}$-complete. Finally, we study the unambiguous problem of finding a weakly dominant strategy in a game, which seems not to lie in $f{Σ^P_2}$.

Problem

• Classifying complexity of unambiguous problems in ΣP2 hierarchy
• Studying computational complexity of social choice and game theory problems
• Analyzing how unambiguity reduces complexity compared to ambiguous variants

Innovation

• Defined unambiguous subclasses PCW and PTW
• Classified complexity of social choice problems
• Proved PCW and PTW coincide with randomization