Calculating Competitive Intransitivity: Computational Challenges

• Published in: The American naturalist Vol. 191; no. 4; p. 547
• Main Authors: Laird, Robert A, Schamp, Brandon S
• Format: Journal Article
• Language: English
• Published: United States 01.04.2018
• Subjects: Competitive Behavior; Models, Biological
• ISSN: 1537-5323
• DOI: 10.1086/696266

Intransitive (or "rock-paper-scissors") competition is compelling because it promotes species coexistence and because recent work suggests that it may be common in natural systems. One class of intransitivity indices works by considering s, the minimum number of competitive reversals to convert a given competitive community (i.e., a "tournament") to a hierarchy. The most straightforward example of such "reversal-based" indices is Petraitis's index, [Formula: see text], where M is the maximum s across all possible n-species tournaments. Using exhaustive searches, we prove that Petraitis's formula for M (and, therefore, t) does not hold for [Formula: see text]. Furthermore, determination of s for even moderate values of n may prove difficult, as the equivalent graph theoretical problem is NP (nondeterministic polynomial time) hard; there is no known computationally feasible way to compute an exact answer for anything but small values of n, let alone a closed-form solution. Petraitis's t is a valuable index of intransitivity; however, at present its use is limited to relatively species-poor systems. More broadly, reversal-based indices, while intuitive, may be problematic because of this computability issue.