The NTU Partitioned Matching Game for International Kidney Exchange Programs

Motivated by the real-world problem of international kidney exchange (IKEP), recent literature introduced a generalized transferable utility matching game featuring a partition of the vertex set of a graph into players, and analyzed its complexity. We explore the non-transferable utility (NTU) variant of the game, where the utility of players is given by the number of their matched vertices. Our motivation for studying this problem is twofold. First, the NTU version is arguably a more natural model of the international kidney exchange program, as the utility of a participating country mostly depends on how many of its patients receive a kidney, which is non-transferable by nature. Second, the special case where each player has two vertices, which we call the NTU matching game with couples, is interesting in its own right and has intriguing structural properties. We study the core of the NTU game, which suitably captures the notion of stability of an IKEP, as it precludes incentives to deviate from the proposed solution for any possible coalition of the players. We prove computational complexity results about the weak and strong cores under various assumptions on the players. In particular, we show that if every player has two vertices, then the weak core is always nonempty, and the existence of a strong core solution can be decided in polynomial time. Moreover, one can efficiently optimize on the strong core. In contrast, it is NP-hard to decide whether the strong core is empty when each player has three vertices. We also show that if the number of players is constant, then the non-emptiness of the weak and strong cores is polynomial-time decidable, and we can find a minimum-cost core solution in polynomial time.

💡 Research Summary

The paper investigates the non‑transferable utility (NTU) version of the partitioned matching game, a cooperative game model that captures the structure of International Kidney Exchange Programs (IKEPs). In this model a graph G = (V, E) represents patient‑donor pairs as vertices and feasible exchanges as edges, while a partition V₁,…,V_m of V assigns each vertex to a “player” (typically a country or a hospital). The utility of player i under a matching M is simply the number of vertices from V_i that are covered by M; unlike the transferable‑utility (TU) version, this utility cannot be redistributed among players, reflecting the reality that a kidney transplant cannot be transferred from one country to another.

The authors focus on two stability concepts derived from the core: the weak core, which forbids any coalition from strictly improving the utility of all its members, and the strong core, which forbids any coalition from improving at least one member without hurting any other. The central research questions are (1) when do these cores exist, (2) how hard is it to decide membership or emptiness, and (3) whether one can efficiently optimize a linear cost function over the core.

Key contributions are organized around three structural regimes:

1. Two‑vertex players (the “couples” case).
   When each player controls exactly two vertices, the authors prove that the weak core is always non‑empty. They give a polynomial‑time algorithm that constructs a weak‑core matching by exploiting alternating‑path and alternating‑cycle structures that intertwine ordinary graph edges with “couple‑edges” (the pair of vertices belonging to the same player). Surprisingly, optimizing a linear cost over the weak core is NP‑hard, showing that existence does not imply tractability of optimization.

   For the strong core, emptiness is possible, but the paper provides a complete structural characterization based on the same alternating‑path framework. Using this characterization they devise a polynomial‑time decision algorithm that determines whether a strong‑core solution exists and, if it does, returns a minimum‑cost strong‑core matching. Consequently, any linear objective (e.g., total travel distance, surgical cost) can be optimized efficiently over the strong core in this regime.

2. Three‑vertex players.
   When each player may control up to three vertices, the problem becomes dramatically harder. The authors prove that deciding whether the strong core is non‑empty is NP‑complete by a reduction from 3‑SAT. This hardness persists even though the weak core remains guaranteed to exist by Scarf’s theorem for balanced NTU games. Thus, the addition of a single extra vertex per player pushes the decision problem from polynomial to intractable.

3. Constant number of players.
   If the number of players m is bounded by a constant (independent of the graph size), the authors show that all core‑related problems—membership testing for weak and strong cores, emptiness checking, and finding minimum‑cost core elements—are solvable in polynomial time, regardless of how many vertices each player controls. The algorithm enumerates all 2^m coalitions (a constant factor) and solves a maximum‑matching subproblem for each, which is polynomial.

Beyond the theoretical results, the paper discusses practical implications for IKEPs. Since real‑world IKEPs involve only a handful of countries, the constant‑player algorithms are directly applicable, enabling the computation of stable, incentive‑compatible matchings that maximize the total number of transplants while respecting each country’s individual interests. The authors also reference simulation studies using the Saidman generator, which empirically show that weak‑core matchings almost always exist in realistic international markets, reinforcing the practical relevance of the weak core despite its NP‑hard optimization.

The “couples” model, while not directly mirroring typical kidney‑exchange settings, provides a rich testbed for understanding how joint preferences (two vertices belonging to the same player) affect core stability. The structural insights about alternating paths and cycles may inspire future algorithmic designs for other matching markets with coupled agents, such as family‑based organ donation or school‑choice problems with sibling constraints.

In summary, the paper delivers a comprehensive complexity landscape for NTU partitioned matching games: polynomial‑time algorithms for the two‑vertex case and constant‑player case, NP‑hardness for three‑vertex players, and a clear separation between existence (always true for weak core) and tractable optimization (only for strong core in the two‑vertex case). These results both deepen the theoretical understanding of cooperative matching games and provide concrete algorithmic tools for designing stable, fair, and efficient international kidney‑exchange programs.