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 an edge weighting w. The set N consists of a number of players that are to form a set M is a subset of E of 2-player...

The stable roommates problem with payments has as input a graph G(E,V) with an edge weighting w:E→R+ and the problem is to find a stable solution. A solution is a matching M with a vector pϵRV that satisfies 􂀀pu+pv=w(uv) for all uvϵM and pu=0 for all u unmatched in M. A solution is stable...

A matching game is a cooperative game (N; v) defined on a graph G = (N;E) with an edge weighting w : E → R+. The player set is N and the value of a coalition S C̱ N is defined as the maximum weight of a matching in the subgraph induced by S. First we present an O (nm+n2 log n) algorithm that...

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 an edge weighting w. The set N consists of a number of players that are to form a set M is a subset of E of 2-player...

A matching game is a cooperative game (N; v) defined on a graph G = (N;E) with an edge weighting w : E ! R+. The player set is N and the value of a coalition S N is defined as the maximum weight of a matching in the subgraph induced by S. First we present an O(nm+n2 log n) algorithm that tests...