  We study the optimization of the stable marriage problem. All individuals
attempt to optimize their own satisfaction, subject to mutually conflicting
constraints. We find that the stable solutions are generally not the globally
best solution, but reasonably close to it. All the stable solutions form a
special sub-set of the meta-stable states, obeying interesting scaling laws.
Both numerical and analytical tools are used to derive our results.
