Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Gangam, Rohith Reddy"'
We study popularity for matchings under preferences. This solution concept captures matchings that do not lose against any other matching in a majority vote by the agents. A popular matching is said to be robust if it is popular among multiple instan
Externí odkaz:
http://arxiv.org/abs/2401.12653
[MV18] introduced a fundamental new algorithmic question on stable matching, namely finding a matching that is stable under two ``nearby'' instances, where ``nearby'' meant that in going from instance $A$ to $B$, only one agent changes its preference
Externí odkaz:
http://arxiv.org/abs/2304.02590
Recently MV18 identified and initiated work on the new problem of understanding structural relationships between the lattices of solutions of two "nearby" instances of stable matching. They also gave an application of their work to finding a robust s
Externí odkaz:
http://arxiv.org/abs/1804.05537
Recently [Mai and Vazirani, 2018] identified and initiated work on a new problem, namely understanding structural relationships between the lattices of solutions of two "nearby" instances of stable matching. They also gave an application of their wor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::717f9172fedb183414e47a59ff094f1a