Note on an auction procedure for a matching game in polynomial time

Authors:
Winfried Hochstättler;Hui Jin;Robert Nickel
Affiliations:
Department of Mathematics, FernUniversität in Hagen, Hagen;Department of Mathematics, Brandenburg Technical University Cottbus, Cottbus;Department of Mathematics, FernUniversität in Hagen, Hagen
Venue:
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Year:
2006

Citing 6
Cited 0

Efficient algorithms for finding maximum matching in graphs

ACM Computing Surveys (CSUR)
The stable marriage problem: structure and algorithms

The stable marriage problem: structure and algorithms
On the complexity of cooperative solution concepts

Mathematics of Operations Research
On the complexity of testing membership in the core of min-cost spanning tree games

International Journal of Game Theory
Combinatorial optimization games

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Stable matching in a common generalization of the marriage and assignment models

Discrete Mathematics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We derive a polynomial time algorithm to compute a stable solution in a mixed matching market from an auction procedure as presented by Eriksson and Karlander [5]. As a special case we derive an $\mathcal{O}(nm)$ algorithm for bipartite matching that does not seem to have appeared in the literature yet.