Story
Markets are competitive if and only if P != NP
1 report
1 website
1 discussion
Latest report
Overview
Competitive market outcomes necessitate computational intractability, indicating that if P = NP, firms could effectively solve collusion detection problems. This efficiency would allow for sustainable collusion as an equilibrium in complex, noisy markets.
Summary from arxiv.org.
Reports
One report so far. Additional coverage will appear here when it is linked to this story.
Community reactions
Each reaction summarizes sampled comments from the linked discussion.
Hacker News · arxiv.org
Hacker News discussion ↗
Historical count: 5 · 5 saved in sample · Historical sample
Analysis ready
Read this discussion’s reaction
Based on 5 sampled comments from this thread. Analyzed 2026-07-03.
- Praise: The paper's exploration of the relationship between computational complexity and market efficiency could reshape our understanding of economic models and regulatory policies.
- Praise: The author's credibility adds weight to the claims made in the paper, suggesting that the implications for market dynamics are worth considering.
- Concern: The assumption that P != NP leads to impractical conclusions about market behavior, as real-world complexities often defy theoretical models.
- Concern: Many commenters argue that the implications of the paper are overstated, as real markets are messy and don't conform to simplified computational assumptions.