How do I marry thee? Let me count the ways

0.00 Avg rating—0 Votes

Article ID:	iaor19971007
Country:	Netherlands
Volume:	59
Issue:	3
Start Page Number:	285
End Page Number:	292
Publication Date:	May 1995
Journal:	Discrete Applied Mathematics
Authors:	Benjamin Arthur T., Converse Charlyn, Krieger Henry A.
Keywords:	optimization

Abstract:

A stable marriage problem of size 2n is constructed which contains equ1 ^{stable matchings. This construction provides a new lower bound on the maximum number of stable matchings for problems of even size and is comparable to a known lower bound when the size is a power of 2. The method of construction makes use of special properties of the latin marriage problem, which the authors develop.}

Reviews

Required fields are marked *. Your email address will not be published.