Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Marriage Problem: Gale Shapley Algorithm
Graph Chatbot
Related lectures (27)
Greedy Change-Making Algorithm: Optimality and Stability
Explores the optimality of the greedy change-making algorithm and the stability of maximum matching.
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.
Algorithms: Stable Matchings
Covers the concept of stable matchings and the Gale-Shapley algorithm.
Algorithms: Stable Matchings
Covers the concept of stable matchings and the Gale-Shapley algorithm.
Matroids: Matroid Intersection
Covers the concept of matroids, focusing on matroid intersection and the properties of subsets of a ground set.
Recent Advances in the Dimer Model and Its Applications
Covers recent advancements in the dimer model, emphasizing its applications in probability and conformal field theory.
Linear Programming: Weighted Bipartite Matching
Covers linear programming, weighted bipartite matching, and vertex cover problems in optimization.
Graphical models: Inference and Factor Graphs
Explores graphical models, factor graphs, and probabilistic inferences in complex systems.
Handling Network Data
Covers handling network data, types of graphs, centrality measures, and properties of real-world networks.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Linear Programming Duality
Explores linear programming duality, covering constraints, variables, solutions, and the relationship between primal and dual LP.
Graph Algorithms: Ford-Fulkerson and Strongly Connected Components
Discusses the Ford-Fulkerson method and strongly connected components in graph algorithms.
Algorithms: Union Find and Minimum Spanning Trees
Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.
Polynomial Identity Testing
Covers polynomial identity testing using oracles and random point evaluation, with applications in graph theory and algorithmic aspects.
Graphical Models: Representing Probabilistic Distributions
Covers graphical models for probabilistic distributions using graphs, nodes, and edges.
Handling Network Data
Explores handling network data, including types of graphs, real-world network properties, and node importance measurement.
Ford-Fulkerson Method: Disjoint-set Data Structures
Explores the Ford-Fulkerson method for maximal flow and disjoint-set data structures.
The Marriage Problem
Log in to Mediaspace to watch this video
Explores the marriage problem, where a bride must strategically accept suitors to maximize her chances of selecting the best one.
Pseudorandomness: Expander Mixing Lemma
Log in to Mediaspace to watch this video
Explores pseudorandomness and the Expander Mixing Lemma in the context of d-regular graphs.
The Marriage Problem
Log in to Mediaspace to watch this video
Explores the marriage problem, modeling the process as a controlled stochastic process with dynamic programming algorithms to find the optimal policy for accepting bachelors.
Previous
Page 1 of 2
Next
