Markets are competitive if and only if P != NP

The Computational Link Between Market Competitiveness and P vs NP

A recent paper, "Markets are competitive if and only if P != NP," proposes a fundamental theoretical link between computational complexity theory and market dynamics. The central thesis is that markets can be either informationally efficient or competitive, but not both, and that the existence of competitive markets depends on the condition that P does not equal NP (P != NP).

Computational Complexity and Market Regimes

The paper argues that the ability of firms to coordinate and collude is a function of their computational capabilities. Specifically, it suggests that as computational power increases—particularly through the deployment of artificial intelligence—firms are pushed from a competitive regime toward a collusive one. This shift explains the empirical emergence of "algorithmic collusion," where firms reach similar pricing strategies without explicit coordination.

According to the author, the increased compute allows firms to derive prices and detect patterns in a way that mimics collusion, effectively reducing the competitiveness of the market as the computational barrier to finding optimal (and potentially collusive) pricing strategies drops.

The Trade-off Between Efficiency and Competitiveness

A key conclusion of the research is the mutual exclusivity of perfect informational efficiency and perfect competitiveness.

• Informational Efficiency: A state where all available information is already reflected in prices.
• Market Competitiveness: A state where no single firm or group of firms can manipulate prices to their advantage.

The paper posits that if a market were perfectly efficient, the computational ease of processing information would likely lead to the same collusive outcomes mentioned above, thereby destroying competitiveness.

Technical and Economic Critiques

The paper's claims have sparked significant discussion among the technical and economic communities, focusing on the practical application of complexity theory to real-world markets.

Heuristics vs. Theoretical Complexity

Critics argue that while P != NP may be a theoretical requirement for certain market properties, it is often irrelevant in practice. Many NP-complete problems are solved daily using heuristics and approximations that provide "good enough" solutions for firms, regardless of whether a polynomial-time solution exists.

"NP-Completeness is the norm, not the exception... Many NP-Complete instance ensembles turn out to effectively have polynomial time solutions... proving NP-Completeness is not a death knell for approximation."

The Information Problem (Hayekian View)

Some observers note that the paper addresses the computation of information but ignores the acquisition of it. Drawing on Friedrich Hayek's theories, they argue that the primary bottleneck is not the processing power (compute), but the fact that critical market information is decentralized, local, and constantly changing.

The Role of AI in Market Synchronization

There is a consensus among some commenters that AI leads to a form of "silent