4 citations · 5 across the 3 of their papers we have counts for
3 papers
The weighted stable matching problem
Linda Farczadi, Natália Guričanová
We study the stable matching problem in non-bipartite graphs with incomplete but strict preference lists, where the edges have weights and the goal is to compute a stable matching…
Stable marriage with general preferences
Linda Farczadi, Konstantinos Georgiou, Jochen Könemann
We propose a generalization of the classical stable marriage problem. In our model, the preferences on one side of the partition are given in terms of arbitrary binary relations, w…
Network bargaining with general capacities
Linda Farczadi, Konstantinos Georgiou, Jochen Koenemann
We study balanced solutions for network bargaining games with general capacities, where agents can participate in a fixed but arbitrary number of contracts. We provide the first po…