Related articles

NP-hard

Computational complexity classification; the paper proves the arbitrage allocation problem and optimal fixed ordering are generally NP-hard.

• Computational Arbitrage Across AI Model Marketplaces Can Be Made Tractable, arXiv Paper Argues