[HTML][HTML] Strategyproof mechanism for two-sided matching with resource allocation
In this work, we consider a student-project-resource matching-allocation problem, where
students have preferences over projects and the projects have preferences over students. In …
students have preferences over projects and the projects have preferences over students. In …
Hedonic diversity games: A complexity picture with more than two colors
Hedonic diversity games are a variant of the classical hedonic games designed to better
model a variety of questions concerning diversity and fairness. Previous works mainly …
model a variety of questions concerning diversity and fairness. Previous works mainly …
Optimal seat arrangement: what are the hard and easy cases?
We study four NP-hard optimal seat arrangement problems [Bodlaender et al., 2020a], which
each have as input a set of n agents, where each agent has cardinal preferences over other …
each have as input a set of n agents, where each agent has cardinal preferences over other …
The three-dimensional stable roommates problem with additively separable preferences
Abstract The Stable Roommates problem involves matching a set of agents into pairs based
on the agents' strict ordinal preference lists. The matching must be stable, meaning that no …
on the agents' strict ordinal preference lists. The matching must be stable, meaning that no …
Multi-dimensional stable roommates in 2-dimensional Euclidean space
J Chen, S Roy - arXiv preprint arXiv:2108.03868, 2021 - arxiv.org
We investigate the Euclidean $ d $-Dimensional Stable Roommates problem, which asks
whether a given set~ $ V $ of $ d\cdot n $ points from the 2-dimensional Euclidean space …
whether a given set~ $ V $ of $ d\cdot n $ points from the 2-dimensional Euclidean space …
Maximally satisfying lower quotas in the hospitals/residents problem with ties
H Goko, K Makino, S Miyazaki, Y Yokoi - arXiv preprint arXiv:2105.03093, 2021 - arxiv.org
Motivated by the serious problem that hospitals in rural areas suffer from a shortage of
residents, we study the Hospitals/Residents model in which hospitals are associated with …
residents, we study the Hospitals/Residents model in which hospitals are associated with …
A Map of Diverse Synthetic Stable Matching Instances
Abstract Focusing on Stable Roommates (SR), we contribute to the toolbox for conducting
experiments for stable matching problems. We introduce the polynomial-time computable …
experiments for stable matching problems. We introduce the polynomial-time computable …
A map of diverse synthetic stable roommates instances
Focusing on Stable Roommates (SR) instances, we contribute to the toolbox for conducting
experiments for stable matching problems. We introduce a polynomial-time computable …
experiments for stable matching problems. We introduce a polynomial-time computable …
Parameterized complexity of stable roommates with ties and incomplete lists through the lens of graph parameters
R Bredereck, K Heeger, D Knop… - Information and …, 2022 - Elsevier
We continue and extend previous work on the parameterized complexity analysis of the NP-
hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening …
hard Stable Roommates with Ties and Incomplete Lists problem, thereby strengthening …
Deepening the (parameterized) complexity analysis of incremental stable matching problems
N Boehmer, K Heeger, R Niedermeier - arXiv preprint arXiv:2208.01563, 2022 - arxiv.org
When computing stable matchings, it is usually assumed that the preferences of the agents
in the matching market are fixed. However, in many realistic scenarios, preferences change …
in the matching market are fixed. However, in many realistic scenarios, preferences change …