4 citations · 4 across the 9 of their papers we have counts for
4 papers · 1 filter
On the closest balanced game
Pedro García-Segador, Michel Grabisch, Dylan Laplace Mermoud +1
Cooperative games with nonempty core are called balanced, and the set of balanced games is a polyhedron. Given a game with empty core, we look for the closest balanced game, in the…
Minimal balanced collections and their applications to core stability and other topics of game theory
Dylan Laplace Mermoud, Michel Grabisch, Peter Sudhölter
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. H…
Combinatorics on Social Configurations
Dylan Laplace Mermoud, Pierre Popoli
In cooperative game theory, the social configurations of players are modeled by balanced collections. The Bondareva-Shapley theorem, perhaps the most fundamental theorem in coopera…
Geometry of Set Functions in Game Theory: Combinatorial and Computational Aspects
Dylan Laplace Mermoud
The main ambition of this thesis is to contribute to the development of cooperative game theory towards combinatorics, algorithmics and discrete geometry. Therefore, the first chap…