Sciweavers

Share
SODA
2008
ACM

Sampling stable marriages: why spouse-swapping won't work

8 years 3 months ago
Sampling stable marriages: why spouse-swapping won't work
We study the behavior of random walks along the edges of the stable marriage lattice for various restricted families of allowable preference sets. In the "k-attribute model," each man is valued in each of k attributes, and each woman's ranking of the men is determined by a linear function, representing her relative ranking of those attributes; men's rankings of the women are determined similarly. We show that sampling with a random walk on the marriage lattice can take exponential time, even when k = 2. Moreover, we show that the marriage lattices arising in the k-attribute model are more restrictive than in the general setting; previously such a restriction had only been shown for the sets of preference lists. The second model we consider is the "k-range model," where each person lies in a position in [i, i + k - 1], for some i, on every preference list of the opposite sex. When k = 1 there is a unique stable marriage. When k = 2 there already can be an ...
Nayantara Bhatnagar, Sam Greenberg, Dana Randall
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where SODA
Authors Nayantara Bhatnagar, Sam Greenberg, Dana Randall
Comments (0)
books