Sciweavers

Share
AAIM
2006
Springer

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

10 years 5 months ago
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.
Winfried Hochstättler, Hui Jin 0002, Robert N
Added 13 Jun 2010
Updated 13 Jun 2010
Type Conference
Year 2006
Where AAIM
Authors Winfried Hochstättler, Hui Jin 0002, Robert Nickel
Comments (0)
books