The Stable Fixtures Problem with Payments

Péter Biró, Walter Kern, Daniël Paulusma +1

We generalize two well-known game-theoretic models by introducing multiple partners matching games, defined by a graph $G=(N,E)$, with an integer vertex capacity function $b$ and a…