- Library Home /
- Search Collections /
- Open Collections /
- Browse Collections /
- BIRS Workshop Lecture Videos /
- A Simply Exponential upper bound on the Number of Stable...
Open Collections
BIRS Workshop Lecture Videos
Featured Collection
BIRS Workshop Lecture Videos
A Simply Exponential upper bound on the Number of Stable Matchings Oveis Gharan, Shayan
Description
We show that for any stable matching instance with n men and n women the number of stable matchings is at most C^n for some universal constant C>1.
Our proof is based on a reduction to counting the number of downsets of a family of posets that we call mixing. This could be of independent interest in other counting applications.
joint work with Anna Karlin and Robbie Weber
Item Metadata
| Title |
A Simply Exponential upper bound on the Number of Stable Matchings
|
| Creator | |
| Publisher |
Banff International Research Station for Mathematical Innovation and Discovery
|
| Date Issued |
2017-11-14T09:02
|
| Description |
We show that for any stable matching instance with n men and n women the number of stable matchings is at most C^n for some universal constant C>1.
Our proof is based on a reduction to counting the number of downsets of a family of posets that we call mixing. This could be of independent interest in other counting applications.
joint work with Anna Karlin and Robbie Weber
|
| Extent |
48 minutes
|
| Subject | |
| Type | |
| File Format |
video/mp4
|
| Language |
eng
|
| Notes |
Author affiliation: University of Washington
|
| Series | |
| Date Available |
2018-05-13
|
| Provider |
Vancouver : University of British Columbia Library
|
| Rights |
Attribution-NonCommercial-NoDerivatives 4.0 International
|
| DOI |
10.14288/1.0366267
|
| URI | |
| Affiliation | |
| Peer Review Status |
Unreviewed
|
| Scholarly Level |
Faculty
|
| Rights URI | |
| Aggregated Source Repository |
DSpace
|
Item Media
Item Citations and Data
Rights
Attribution-NonCommercial-NoDerivatives 4.0 International