Stable fractional matchings

by   Ioannis Caragiannis, et al.

We study a generalization of the classical stable matching problem that allows for cardinal preferences (as opposed to ordinal) and fractional matchings (as opposed to integral). After observing that, in this cardinal setting, stable fractional matchings can have much higher social welfare than stable integral ones, our goal is to understand the computational complexity of finding an optimal (i.e., welfare-maximizing) or nearly-optimal stable fractional matching. We present simple approximation algorithms for this problem with weak welfare guarantees and, rather unexpectedly, we furthermore show that achieving better approximations is hard. This computational hardness persists even for approximate stability. To the best of our knowledge, these are the first computational complexity results for stable fractional matchings. En route to these results, we provide a number of structural observations.


page 1

page 2

page 3

page 4


Fractional Matchings under Preferences: Stability and Optimality

We thoroughly study a generalized version of the classic Stable Marriage...

A Study of Incentive Compatibility and Stability Issues in Fractional Matchings

Stable matchings have been studied extensively in both economics and com...

The Price of Justified Representation

In multiwinner approval voting, the goal is to select k-member committee...

Dynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms

We present a simple randomized reduction from fully-dynamic integral mat...

Strategyproof Mechanisms for Additively Separable Hedonic Games and Fractional Hedonic Games

Additively separable hedonic games and fractional hedonic games have rec...

Computational Complexity of Stable Marriage and Stable Roommates and Their Variants

This paper gives an overview on and summarizes existing complexity and a...

Algebraic Algorithms for Fractional Linear Matroid Parity via Non-commutative Rank

Matrix representations are a powerful tool for designing efficient algor...