← All topics
computational-complexity
Latest stories covering computational-complexity, with summaries and links to related coverage.
1 stories · 1 reports · page 1 of 1
Connected topics
Markets are competitive if and only if P != NP
research
2 min read
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.