At most 4.47^n stable matchings

11/02/2020
by   Cory Palmer, et al.
0

We improve the upper bound for the maximum possible number of stable matchings among n men and n women from O(131072^n) to O(4.47^n). To establish this bound, we develop a novel formulation of a probabilistic technique that is easy to apply and may be of independent interest in counting other combinatorial objects.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

11/03/2017

A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings

Stable matching is a classical combinatorial problem that has been the s...
05/18/2018

Maximum Likelihood Upper Bounds on the Capacities of Discrete Information Stable Channels

Motivated by a greedy approach for generating information stable process...
02/13/2020

An almost optimal bound on the number of intersections of two simple polygons

What is the maximum number of intersections of the boundaries of a simpl...
05/13/2022

Improved Upper Bound on Independent Domination Number for Hypercubes

We revisit the problem of determining the independent domination number ...
09/17/2021

Online Learning of Network Bottlenecks via Minimax Paths

In this paper, we study bottleneck identification in networks via extrac...
07/30/2020

Rademacher upper bounds for cross-validation errors with an application to the lasso

We establish a general upper bound for K-fold cross-validation (K-CV) er...
02/22/2021

Probabilistic Learning on Manifolds (PLoM) with Partition

The probabilistic learning on manifolds (PLoM) introduced in 2016 has so...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.