3 papers
cs.GT2026
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…
math.CO2025
On the Set of Balanced Games
Pedro Garcia-Segador, Michel Grabisch, Pedro Miranda
We study the geometric structure of the set of cooperative transferable utility games having a nonempty core, characterized by Bondareva and Shapley as balanced games. We show that…
math.CO2024
Polynomial representation of TU-games
Ulrich Faigle, Michel Grabisch
We propose in this paper a polynomial representation of TU-games, fuzzy measures, capacities, and more generally set functions. Our representation needs a countably infinite set of…