Note on an Auction Procedure for a Matching Game in Polynomial Time

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 O(nm) algorithm for bipartite matching that does not seem to have appeared in the literature yet.

• Type: Conference
• Year: 2006
• Where: AAIM
• Authors: Winfried Hochstättler, Hui Jin 0002, Robert Nickel
• Keywords: AAIM 2006, Algorithms, Mixed Matching Market, Polynomial Time Algorithm, Stable Solution