Related papers: Capacity Modification in the Stable Matching Probl…
Coalition formation studies how to partition a set of agents into disjoint coalitions under consideration of their preferences. We study the classical objective of stability in a variant of additively separable hedonic games where agents…
The Hospital Residents problem with sizes (HRS) is a generalization of the well-studied hospital residents (HR) problem. In the HRS problem, an agent $a$ has a size $s(a)$ and the agent occupies $s(a)$ many positions of the hospital $h$…
Component substitution has numerous practical applications and constitutes an active research topic. This paper proposes to enrich an existing component-based framework--a model with dynamic reconfigurations making the system evolve--with a…
In this paper, we demonstrate that in many NP-complete variants of the stable matching problem, such as the Stable Hypergraph Matching problem, the Stable Multicommodity Flow problem, and the College Admission problem with common quotas, a…
We study many-to-one matching problems between institutions and individuals, where each institution may be matched to multiple individuals. The matching market includes couples, who view pairs of institutions as complementary. Institutions'…
This article introduces analytical techniques and a decision support tool to support capacity assessment and case mix planning (CMP) approaches previously created for hospitals. First, an optimization model is proposed to analyse the impact…
In the {\sc Course Allocation} problem, there are a set of students and a set of courses at a given university. University courses may have different numbers of credits, typically related to different numbers of learning hours, and there…
Decision makers are often confronted with complex tasks which cannot be solved by an individual alone, but require collaboration in the form of a coalition. Previous literature argues that instability, in terms of the re-organization of a…
Reallocation scheduling is one of the most fundamental problems in various areas such as supply chain management, logistics, and transportation science. In this paper, we introduce the reallocation problem that models the scheduling in…
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…
Two-sided manufacturing-as-a-service (MaaS) marketplaces connect clients requesting manufacturing services to suppliers providing those services. Matching mechanisms i.e. allocation of clients' orders to suppliers is a key design parameter…
The Stable Marriage Problem is to find a one-to-one matching for two equally sized sets of agents. Due to its widespread applications in the real world, especially the unique importance to the centralized match maker, a very large number of…
We consider a variant of the berth allocation problem-i.e., the multi-port berth allocation problem-aimed at assigning berthing times and positions to vessels in container terminals. This variant involves optimizing vessel travel speeds…
The manpower scheduling problem is a kind of critical combinational optimization problem. Researching solutions to scheduling problems can improve the efficiency of companies, hospitals, and other work units. This paper proposes a new model…
Many set selection and ranking algorithms have recently been enhanced with diversity constraints that aim to explicitly increase representation of historically disadvantaged populations, or to improve the overall representativeness of the…
We consider a setting where goods are allocated to agents by way of an allocation platform (e.g., a matching platform). An ``allocation facilitator'' aims to increase the overall utility/social-good of the allocation by encouraging (some of…
Many-to-many matching with contracts is studied in the framework of revealed preferences. All preferences are described by choice functions that satisfy natural conditions. Under a no-externality assumption individual preferences can be…
We investigate how robust the results of committee elections are to small changes in the input preference orders, depending on the voting rules used. We find that for typical rules the effect of making a single swap of adjacent candidates…
Consider a cyclically ordered collection of $r$ equinumerous agent sets with strict preferences of every agent over the agents from the next agent set. A weakly stable cyclic matching is a partition of the set of agents into disjoint union…
The stable marriage problem has been introduced in order to describe a complex system where individuals attempt to optimise their own satisfaction, subject to mutually conflicting constraints. Due to the potential large applicability of…