1 citations · 1 across the 1 of their papers we have counts for
2 papers
math.CO2025
Stable matchings with switching costs
Boris Pittel, Kirill Rudov
In a stable matching problem there are two groups of agents, with agents on one side having their individual preferences for agents on another side as a potential match. It is assu…
econ.TH2024★ 1 cited
Fragile Stable Matchings
Kirill Rudov
We show how fragile stable matchings are in a decentralized one-to-one matching setting. The classical work of Roth and Vande Vate (1990) suggests simple decentralized dynamics in…