Dömötör Pálvölgyi At most 4. 47 n stable matchings, Big Seminar
It is our pleasure to share the Big Seminar talk by Dömötör Pálvölgyi At most 4. 47n stable matchings. Abstract: We improve the upper bound for the maximum possible number of stable matchings among n men and n women from O(131072n) to 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. Joint work with Cory Palmer. Seminars schedule and archive are available here
|
|