In the Densest k-Subgraph (D k S) problem, given an undirected graph G and an integer k,
the goal is to find a subgraph of G on k vertices that contains maximum number of edges …

We study two generalised stable matching problems motivated by the current matching
scheme used in the higher education sector in Hungary. The first problem is an extension of …

We study matching markets in which institutions may have minimum and maximum quotas.
Minimum quotas are important in many settings, such as hospital residency matching …

Given a graph and an integer k, Densest k-Subgraph is the algorithmic task of finding the
subgraph on k vertices with the maximum number of edges. This is a fundamental problem …

Distributional constraints are important in many market design settings. Prominent examples
include the minimum manning requirements at each Army branch in military cadet matching …

Online platforms, such as Meetup and Plancast, have recently become popular for planning
gatherings and event organization. However, there is a surprising lack of studies on how to …

Abstract The Hospitals/Residents problem is a many-to-one extension of the stable marriage
problem. In an instance, each hospital specifies a quota, ie, an upper bound on the number …

We introduce the classified stable matching problem, a problem motivated by academic
hiring. Suppose that a number of institutes are hiring faculty members from a pool of …

Given an instance I of the classical Stable Marriage problem with Incomplete preference lists
(smi), a maximum cardinality matching can be larger than a stable matching. In many large …

Crowdsourcing has become a popular paradigm to leverage the collective intelligence of
massive crowd workers to perform certain tasks in a cost-effective way. Task assignment is …