The stable fixtures problem-A many-to-many extension of stable roommates

Authors:
Robert W. Irving;Sandy Scott
Affiliations:
Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, Scotland;Department of Computing Science, University of Glasgow, Glasgow G12 8QQ, Scotland
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 7
Cited 8

The structure of the stable roomate problem: efficient representation and enumeration of all stable assignments

SIAM Journal on Computing
The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
Lower bounds for the stable marriage problem and its variants

SIAM Journal on Computing
NP-complete stable matching problems

Journal of Algorithms
Stable marriage and indifference

CO89 Selected papers of the conference on Combinatorial Optimization
Many-to-many matching: stable polyandrous polygamy (or polygamous polyandry)

Discrete Applied Mathematics
The stable roommates problem with ties

Journal of Algorithms

On the stable b-matching problem in multigraphs

Discrete Applied Mathematics
A dynamic exchange game

Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Analysis of user-driven peer selection in peer-to-peer backup and storage systems

Proceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools
Selfish Neighbor Selection in Peer-to-Peer Backup and Storage Applications

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Uncoordinated peer selection in P2P backup and storage applications

INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Rotations in the stable b-matching problem

Theoretical Computer Science
The integral stable allocation problem on graphs

Discrete Optimization
Adaptive distributed b-matching in overlays with preferences

SEA'12 Proceedings of the 11th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.05

Visualization

Abstract

We study a many-to-many generalisation of the well-known stable roommates problem in which each participant seeks to be matched with a number of others. We present a linear-time algorithm that determines whether a stable matching exists, and if so, returns one such matching.