Numerical implementation of a cooperative game algorithm for constructing stable coalition structures based on a pairwise similarity matrix

Title	Numerical implementation of a cooperative game algorithm for constructing stable coalition structures based on a pairwise similarity matrix
Authors	A. K. Solovyeva¹ ¹Bauman Moscow State Technical University
Annotation	The paper considers the construction of a coalition structure on a finite set of objects represented by a pairwise similarity matrix. The proposed approach extends classical clustering by taking into account individual incentives of players to change their coalition membership. A centered pairwise-additive characteristic function of a cooperative game is defined using the similarity matrix. For the Aumann–Dreze value and the Equal Surplus rule, individual payoffs and criteria for profitable unilateral deviations are obtained. A numerical procedure is described that sequentially modifies an initial partition until no profitable individual deviations remain.
Keywords	cooperative game, coalition structure, pairwise similarity matrix, individual stability, Aumann–Dreze value, Equal Surplus, numerical algorithm.
Citation	Solovyeva A. K. ''Numerical implementation of a cooperative game algorithm for constructing stable coalition structures based on a pairwise similarity matrix'' [Electronic resource]. Mathematical modeling, numerical methods, and software systems: Collection of materials from the 12th All‑Russian Scientific Youth School‑Seminar named after E. V. Voskresensky (Saransk, July 21–24, 2026). - pp. 212-216. Available at: https://conf.svmo.ru/files/2026/papers/paper108.pdf. - Date of access: 25.09.2026.

PROCEEDINGS OF THE SCIENTIFIC CONFERENCES AND SCHOOL-SEMINARS

Numerical implementation of a cooperative game algorithm for constructing stable coalition structures based on a pairwise similarity matrix

Contacts