In particular, the goal is to find a matching whose size exceeds that of a stable matching in the graph by at least t and has at most k blocking edges. We study ...
May 17, 2020 · In this paper, we study the question of matching more agents with fewest possible blocking edges. In particular, we find a matching whose size ...
[PDF] On the (Parameterized) Complexity of Almost Stable Marriage ...
www.semanticscholar.org › paper
This paper finds a matching whose size exceeds that of stable matching in the graph by at least t and has at most k blocking edges, and obtains an FPT ...
Dec 4, 2020 · In particular, the goal is to find a matching whose size exceeds that of a stable matching in the graph by at least t and has at most k blocking ...
We study this question in the realm of parameterized complexity with respect to several natural parameters, k,t,d, where d is the maximum length of a preference ...
In this paper, we study the question of matching more agents with fewest possible blocking edges. In particular, we find a matching whose size exceeds that of ...
On the (Parameterized) Complexity of Almost Stable Marriage. Work. HTML. Year: 2020. Type: article. Source: Foundations of Software Technology and Theoretical ...
People also ask
What is the stable marriage game theory?
What is the meaning of stable marriage?
What is the stable marriage problem matrix?
What is the time complexity of stable matching?
May 17, 2020 · Abstract. In the Stable Marriage problem, when the preference lists are complete, all agents of the smaller side can be matched.
Duration: 26:26
Posted: Dec 3, 2020
Posted: Dec 3, 2020
Fingerprint. Dive into the research topics of 'On the (parameterized) complexity of almost stable marriage'. Together they form a unique fingerprint.