Markets are competitive if and only if P = NP

arxiv-logo-fb

Computer Science > Computer Science and Game Theory arXiv:2602.20415 (cs) [Submitted on 23 Feb 2026] Title:Markets are competitive if and only if P != NP Authors:Philip Z. Maymin View a PDF of the paper titled Markets are competitive if and only if P != NP, by Philip Z. Maymin View PDF Abstract:I prove that competitive market outcomes require computational intractability. If P = NP, firms can efficiently solve the collusion detection problem, identifying deviations from cooperative agreements in complex, noisy markets and thereby making collusion sustainable as an equilibrium. If P != NP, the collusion detection problem is computationally infeasible for markets satisfying a natural instance-hardness condition on their demand structure, rendering punishment threats…

Continue reading at Hacker News arxiv.org
Advertisement