Minimal balanced collections and their application to core stability and other topics of game theory - HAL Access content directly
Journal articles Discrete Applied Mathematics Year : 2023

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

Abstract

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.
Main file
Thumbnail
mbc22.pdf ( 380.61 Ko ) Download
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

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⟩
61 View
39 Download
Last update date on 5/18/24
How are these indicators produced

Altmetric

Share

Gmail Facebook Twitter LinkedIn More