English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Following up a recent work by Ashlagi, Kanoria, and Leshno, we study a stable matching problem with unequal side sizes, n “men” and N u003e n “women,” whose preferences for a partner are uniformly random and independent. An asymptotic formula for the expected number of stable matchings is obtained. In particular, for N = n + 1 this number is close to n/(e log n), in notable contrast with (n log n)/e, the formula for the balanced case N = n that we obtained in 1988. We associate with each stable matching ℳ the parameters u0026#x1d4b2;(ℳ) and ℋ(ℳ), which are the total rank of “wives” and the total rank of “husbands,” as ranked by their “spouses” in ℳ. We found the deterministic parameters w(n, N) and h(n, N) such that the set of scaled pairs (u0026#x1d4b2;(ℳ)/w(n, N), ℋ(ℳ)/h(n, N)) converges to a single point. In particular, w(n, n + 1) ∼ n log n, h(n, n + 1) ∼ n2/log n. To compare, for the balanced case n = N we previously found that w(n, n) = h(n, n) = n3/2, and that the pairs of scaled total ranks converged to a hyperbolic arc xy =...

On Likely Solutions of the Stable Matching Problem with Unequal Numbers of Men and Women