Sign inGet started
Paper · arXiv

Computational Foundations for Strategic Coopetition: Formalizing Sequential Interaction and Reciprocity

Strategic coopetition in multi-stakeholder systems requires understanding how cooperation persists through time without binding contracts. This technical report extends computational foundations for strategic coopetition to sequential interaction dynamics, bridging conceptual modeling (i* framework) with game-theoretic reciprocity analysis. We develop: (1) bounded reciprocity response functions mapping partner deviations to finite conditional responses, (2) memory-windowed history tracking capturing cognitive limitations over k recent periods, (3) structural reciprocity sensitivity derived from interdependence matrices where behavioral responses are amplified by structural dependencies, a...

AuthorsVik Pant, Eric Yu
Primary categorycs.MA
Published29 March 2026
Last updated at source29 March 2026
cs.MAcs.AIcs.CYcs.GTcs.SE
Embed this entry
<iframe src="https://silytics.si/embed/item/93a2d417-3a49-4d9e-969d-6b0df0add65c" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Connected in the knowledge graph

Explore this entry in the graph

Models and datasets referencing this paper

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.