23rd CoRe Seminar
Date and time: | 2022.4.25 Mon. 15:00-17:00
|
---|---|
Venue: | Online |
Speaker: | KAMIYAMA, Naoyuki (Kyushu U., Group C01) |
Title: | Pareto stable matchings |
Summary: | In this talk, I consider a matching in a bipartite graph in which each vertex has a preference over the edges incident to it. Especially, I focus on a Pareto stable matching, which is a matching satisfying stability and Pareto efficiency. In talk, I give a survey of a Pareto stable matching including my recent result. I also talk about the relationship between Pareto stable matchings and combinatorial reconfiguration.
|
Update:2022.04.12