Minimal balanced collections and their application to core stability and other topics of game theory - HAL-SHS - Sciences de l'Homme et de la Société Accéder directement au contenu
Article Dans Une Revue Discrete Applied Mathematics Année : 2023

Minimal balanced collections and their application to core stability and other topics of game theory

Résumé

Minimal balanced collections are a generalization of partitions of a finite set of n elements and have important applications in cooperative game theory and discrete mathematics. However, their number is not known beyond n = 4. In this paper we investigate the problem of generating minimal balanced collections and implement the Peleg algorithm, permitting to generate all minimal balanced collections till n = 7. Secondly, we provide practical algorithms to check many properties of coalitions and games, based on minimal balanced collections, in a way which is faster than linear programming-based methods. In particular, we construct an algorithm to check if the core of a cooperative game is a stable set in the sense of von Neumann and Morgenstern. The algorithm implements a theorem according to which the core is a stable set if and only if a certain nested balancedness condition is valid. The second level of this condition requires generalizing the notion of balanced collection to balanced sets.
Fichier principal
Vignette du fichier
mbc22.pdf (380.62 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

halshs-04356803 , version 1 (20-12-2023)

Identifiants

Citer

Dylan Laplace Mermoud, Michel Grabisch, Peter Sudhölter. Minimal balanced collections and their application to core stability and other topics of game theory. Discrete Applied Mathematics, 2023, 341, pp.60-81. ⟨10.1016/j.dam.2023.07.025⟩. ⟨halshs-04356803⟩
62 Consultations
67 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More