{"paper":{"title":"A general classification of the replication dynamics with a unique fixed point in the interior of simplex $S_N$","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The replicator equation on the simplex has a unique interior fixed point if and only if its payoff matrix satisfies explicit algebraic conditions.","cross_cats":["cs.GT","cs.MA"],"primary_cat":"q-bio.PE","authors_text":"Bin Yi, Hongju (Daisy) Chen, Zhanshan (Sam) Ma","submitted_at":"2026-05-11T14:13:48Z","abstract_excerpt":"The replication dynamics (differential equation system) is the foundation of evolutionary game theory. When n=2, there are four possible types of replication dynamics. When n=3, there are 49 possible types of replication dynamics. However, when n>3, the classification of replication dynamics has not been solved. In this article, the sufficient and necessary conditions of the replication dynamics equation with a unique fixed point in the interior of simplex $S_n$(Int$S_n$) for $n\\geq 2$ are presented. Furthermore, the different types of replication dynamics equations with a unique fixed point i"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The sufficient and necessary conditions of the replication dynamics equation with a unique fixed point in the interior of simplex S_n for n greater than or equal to 2 are presented.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the standard form of the replicator equation on the simplex admits a clean algebraic characterization of unique interior fixed points without additional restrictions on the payoff structure or higher-order terms.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"The paper gives necessary and sufficient conditions for the replicator dynamics to possess a unique interior fixed point in the simplex S_n for all n greater than or equal to 2.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The replicator equation on the simplex has a unique interior fixed point if and only if its payoff matrix satisfies explicit algebraic conditions.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"b543074a92741a022268476bf916d2dabf7d17491b5a7fad0397b4d2b0048e74"},"source":{"id":"2605.13883","kind":"arxiv","version":1},"verdict":{"id":"de6e39ff-a752-42e4-8c9c-943615c93254","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T05:28:47.384915Z","strongest_claim":"The sufficient and necessary conditions of the replication dynamics equation with a unique fixed point in the interior of simplex S_n for n greater than or equal to 2 are presented.","one_line_summary":"The paper gives necessary and sufficient conditions for the replicator dynamics to possess a unique interior fixed point in the simplex S_n for all n greater than or equal to 2.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the standard form of the replicator equation on the simplex admits a clean algebraic characterization of unique interior fixed points without additional restrictions on the payoff structure or higher-order terms.","pith_extraction_headline":"The replicator equation on the simplex has a unique interior fixed point if and only if its payoff matrix satisfies explicit algebraic conditions."},"references":{"count":8,"sample":[{"doi":"","year":2015,"title":"When 𝑛=2, there are four possible types of replication dynamics","work_id":"e7caa674-6173-4afe-8b0a-3d2d2240e1bb","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1983,"title":"Note: (1) for case 1 and 2, there is no fixed point in 𝐼𝑛𝑡S9, and all the orbits tend to 𝐵𝑑S9","work_id":"af1a5869-1a21-44ab-a74b-93dcaab5d839","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"However, for this solution to be in Int𝑆., we must have 𝑥,=_`×ab=_`×a_`×a`acd>0,𝑖=1,2,…,𝑁","work_id":"91aae729-0b36-4668-abb2-b55d95295957","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1973,"title":"That is, any orbits except 𝑥≡𝑥∗, we obtain 𝑉𝑥=𝑥,∗pa∗−","work_id":"60b57088-a5e1-4ad6-883e-343ea4e66568","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1982,"title":"Therefore, the payoff matrix of the Hawk-dove game can be derived as follows: 15 A=𝑏−𝑐2𝑏0𝑏2 where 𝑅6=𝐻, 𝑅9=𝐷, are the hawk strategy and dove strategy respectively","work_id":"207a116c-e22c-41af-a0e0-9b3dddc0e34f","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":8,"snapshot_sha256":"bc8c5a72abf3ce76d7c6671189b60245938af8af70d64fe1a6c963d32f82177a","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"830da15f9b10f7d954b810597ab36c46fb0c807a3aaef1fa8ded00f3dffb3584"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}