Title	A Simply Exponential upper bound on the Number of Stable Matchings
Creator	Oveis Gharan, Shayan
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	Mathematics; Computer science; Operations research, mathematical programming; Theoretical computer science
Type	Moving Image
File Format	video/mp4
Language	eng
Notes	Author affiliation: University of Washington
Series	BIRS Workshop Lecture Videos (Banff, Alta)
Date Available	2018-05-14
Provider	Vancouver : University of British Columbia Library
Rights	Attribution-NonCommercial-NoDerivatives 4.0 International
DOI	10.14288/1.0366267
URI	http://hdl.handle.net/2429/65835
Affiliation	Non UBC
Peer Review Status	Unreviewed
Scholarly Level	Faculty
Rights URI	http://creativecommons.org/licenses/by-nc-nd/4.0/
Aggregated Source Repository	DSpace

Open Collections

BIRS Workshop Lecture Videos