Computer Science > Computer Science and Game Theory

[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 non-credible and collusion unstable. Combined with Maymin (2011), who proved that market efficiency requires P = NP, this yields a fundamental impossibility: markets can be informationally efficient or competitive, but not both. Artificial intelligence, by expanding firms' computational capabilities, is pushing markets from the competitive regime toward the collusive regime, explaining the empirical emergence of algorithmic collusion without explicit coordination.

https://doi.org/10.48550/arXiv.2602.20415

arXiv-issued DOI via DataCite

Comments:
Subjects:	Computer Science and Game Theory (cs.GT); Computational Complexity (cs.CC); Theoretical Economics (econ.TH); Computational Finance (q-fin.CP)
MSC classes:	91B26, 68Q17, 91A20
Cite as:	arXiv:2602.20415 [cs.GT]
	(or arXiv:2602.20415v1 [cs.GT] for this version)

Submission history

From: Philip Maymin [view email] [v1] Mon, 23 Feb 2026 23:31:43 UTC (58 KB)

Full-text links:

Access Paper:

• View a PDF of the paper titled Markets are competitive if and only if P != NP, by Philip Z. Maymin

• View PDF

• TeX Source

view license

Current browse context:

cs.GT

< prev | next >

new | recent | 2026-02

Change to browse by:

cs cs.CC econ econ.TH q-fin q-fin.CP

References & Citations

• NASA ADS

• Google Scholar

• Semantic Scholar

Loading...

BibTeX formatted citation

Data provided by:

Bookmark

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)

Connected Papers (What is Connected Papers?)

Litmaps (What is Litmaps?)

scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)

CatalyzeX Code Finder for Papers (What is CatalyzeX?)

DagsHub (What is DagsHub?)

Gotit.pub (What is GotitPub?)

Hugging Face (What is Huggingface?)

ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)

Hugging Face Spaces (What is Spaces?)

TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)

CORE Recommender (What is CORE?)

• Author

• Venue

• Institution

• Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)