Combinatorics on Social Configurations
<|reference_start|>Combinatorics on Social Configurations: In cooperative game theory, the social configurations of players are modeled by balanced collections. The Bondareva-Shapley theorem, perhaps the most fundamental theorem in cooperative game theory, characterizes the existence of solutions to the game that benefit everyone using balanced collections. Roughly speaking, if the trivial set system of all players is one of the most efficient balanced collections for the game, then the set of solutions from which each coalition benefits, the so-called core, is non-empty.   In this paper, we discuss some interactions between combinatorics and cooperative game theory that are still relatively unexplored. Indeed, the similarity between balanced collections and uniform hypergraphs seems to be a relevant point of view to obtain new properties on those collections through the theory of combinatorial species.<|reference_end|>
@article{mermoud2024combinatorics,
    title={Combinatorics on Social Configurations},
    author={Dylan Laplace Mermoud (UMA, ENSTA Paris, Institut Polytechnique de
  Paris), Pierre Popoli (Department of Mathematics, Uliège)},
    journal={EPTCS 403, 2024, pp. 128-133},
    year={2024},
    doi={10.4204/EPTCS.403.27},
    archivePrefix={arXiv},
    eprint={2406.16409},
    primaryClass={cs.GT cs.DM}
}