Showing 2026Show all
2 papers · 1 filter
cs.GT2026
Polyhedral Methods for Cooperative Games: Small Lifts and Hard Faces
Hans Raj Tiwary, Michel Grabisch
We study the computational complexity of fundamental algorithmic problems -- membership testing, separation, valid-inequality testing, and linear optimization -- over polytopes and…
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…