Strong stability in the Hospitals/Residents problem

We study a version of the well-known Hospitals/Residents problem in which participants' preferences may involve ties or other forms of indifference. In this context, we investigate the concept of strong stability, arguing that this may be the most appropriate and desirable form of stability in many practical situations. When the indifference is in the form of ties, we describe an O(a^2) algorithm to find a strongly stable matching, if one exists, where a is the number of mutually acceptable resident-hospital pairs. We also show a lower bound in this case in terms of the complexity of determining whether a bipartite graph contains a perfect matching. By way of contrast, we prove that it becomes NP-complete to determine whether a strongly stable matching exists if the preferences are allowed to be arbitrary partial orders

The hospitals/residents problem with ties

The hospitals/residents problem is an extensively-studied many-one stable matching problem. Here, we consider the hospitals/residents problem where ties are allowed in the preference lists. In this extended setting, a number of natural definitions for a stable matching arise. We present the first linear-time algorithm for the problem under the strongest of these criteria, so-called super-stability . Our new results have applications to large-scale matching schemes, such as the National Resident Matching Program in the US, and similar schemes elsewhere

Approximability results for stable marriage problems with ties

We consider instances of the classical stable marriage problem in which persons may include ties in their preference lists. We show that, in such a setting, strong lower bounds hold for the approximability of each of the problems of finding an egalitarian, minimum regret and sex-equal stable matching. We also consider stable marriage instances in which persons may express unacceptable partners in addition to ties. In this setting, we prove that there are constants delta, delta' such that each of the problems of approximating a maximum and minimum cardinality stable matching within factors of delta, delta' (respectively) is NP-hard, under strong restrictions. We also give an approximation algorithm for both problems that has a performance guarantee expressible in terms of the number of lists with ties. This significantly improves on the best-known previous performance guarantee, for the case that the ties are sparse. Our results have applications to large-scale centralized matching schemes

An Algorithm for Strong Stability in the Student-Project Allocation Problem With Ties

We study a variant of the Student-Project Allocation problem with lecturer preferences over Students where ties are allowed in the preference lists of students and lecturers (spa-st). We investigate the concept of strong stability in this context. Informally, a matching is strongly stable if there is no student and lecturer l such that if they decide to form a private arrangement outside of the matching via one of l’s proposed projects, then neither party would be worse off and at least one of them would strictly improve. We describe the first polynomial-time algorithm to find a strongly stable matching or report that no such matching exists, given an instance of spa-st. Our algorithm runs in O(m2) time, where m is the total length of the students’ preference lists

DNMT1 and Cancer: An Electrifying Link

Aberrant epigenetic methylation is linked to the onset and progression of cancer. In this issue of Chemistry & Biology, Furst and Barton (2015) describe a sensitive electrochemical assay that can detect hyperactive epigenetic methylation in tumor tissue

The Stable Roommates problem with short lists

We consider two variants of the classical Stable Roommates problem with Incomplete (but strictly ordered) preference lists SRI that are degree constrained, i.e., preference lists are of bounded length. The first variant, EGAL d-SRI, involves finding an egalitarian stable matching in solvable instances of SRI with preference lists of length at most d. We show that this problem is NP-hard even if d=3. On the positive side we give a (2d+3)/7-approximation algorithm for d={3,4,5} which improves on the known bound of 2 for the unbounded preference list case. In the second variant of SRI, called d-SRTI, preference lists can include ties and are of length at most d. We show that the problem of deciding whether an instance of d-SRTI admits a stable matching is NP-complete even if d=3. We also consider the "most stable" version of this problem and prove a strong inapproximability bound for the d=3 case. However for d=2 we show that the latter problem can be solved in polynomial time.Comment: short version appeared at SAGT 201

Maximum weight cycle packing in directed graphs, with application to kidney exchange programs

Centralized matching programs have been established in several countries to organize kidney exchanges between incompatible patient-donor pairs. At the heart of these programs are algorithms to solve kidney exchange problems, which can be modelled as cycle packing problems in a directed graph, involving cycles of length 2, 3, or even longer. Usually, the goal is to maximize the number of transplants, but sometimes the total benefit is maximized by considering the differences between suitable kidneys. These problems correspond to computing cycle packings of maximum size or maximum weight in directed graphs. Here we prove the APX-completeness of the problem of finding a maximum size exchange involving only 2-cycles and 3-cycles. We also present an approximation algorithm and an exact algorithm for the problem of finding a maximum weight exchange involving cycles of bounded length. The exact algorithm has been used to provide optimal solutions to real kidney exchange problems arising from the National Matching Scheme for Paired Donation run by NHS Blood and Transplant, and we describe practical experience based on this collaboration

A model for leveraging animal movement to understand spatio-temporal disease dynamics

The ongoing explosion of fine-resolution movement data in animal systems provides a unique opportunity to empirically quantify spatial, temporal and individual variation in transmission risk and improve our ability to forecast disease outbreaks. However, we lack a generalizable model that can leverage movement data to quantify transmission risk and how it affects pathogen invasion and persistence on heterogeneous landscapes. We developed a flexible model ‘Movement-driven modelling of spatio-temporal infection risk’ (MoveSTIR) that leverages diverse data on animal movement to derive metrics of direct and indirect contact by decomposing transmission into constituent processes of contact formation and duration and pathogen deposition and acquisition. We use MoveSTIR to demonstrate that ignoring fine-scale animal movements on actual landscapes can mis-characterize transmission risk and epidemiological dynamics. MoveSTIR unifies previous work on epidemiological contact networks and can address applied and theoretical questions at the nexus of movement and disease ecology

Epidemic growth rates and host movement patterns shape management performance for pathogen spillover at the wildlife–livestock interface

Managing pathogen spillover at the wildlife–livestock interface is a key step towards improving global animal health, food security and wildlife conservation. However, predicting the effectiveness of management actions across host–pathogen systems with different life histories is an on-going challenge since data on intervention effectiveness are expensive to collect and results are system-specific.We developed a simulation model to explore how the efficacies of different management strategies vary according to host movement patterns and epidemic growth rates. The model suggested that fast-growing, fast-moving epidemics like avian influenza were best-managed with actions like biosecurity or containment, which limited and localized overall spillover risk. For fast-growing, slower-moving diseases like foot-and-mouth disease, depopulation or prophylactic vaccination were competitive management options. Many actions performed competitively when epidemics grew slowly and host movements were limited, and how management efficacy related to epidemic growth rate or host movement propensity depended on what objectivewas used to evaluatemanagement performance. This framework offers one means of classifying and prioritizing responses to novel pathogen spillover threats, and evaluating current management actions for pathogens emerging at the wildlife–livestock interface. This article is part of the theme issue ‘Dynamic and integrative approaches to understanding pathogen spillover’

Deriving spatially explicit direct and indirect interaction networks from animal movement data

Quantifying spatiotemporally explicit interactions within animal populations facilitates the understanding of social structure and its relationship with ecological processes. Data from animal tracking technologies (Global Positioning Systems [“GPS”]) can circumvent longstanding challenges in the estimation of spatiotemporally explicit interactions, but the discrete nature and coarse temporal resolution of data mean that ephemeral interactions that occur between consecutive GPS locations go undetected. Here, we developed a method to quantify individual and spatial patterns of interaction using continuous-time movement models (CTMMs) fit to GPS tracking data. We first applied CTMMs to infer the full movement trajectories at an arbitrarily fine temporal scale before estimating interactions, thus allowing inference of interactions occurring between observed GPS locations. Our framework then infers indirect interactions—individuals occurring at the same location, but at different times—while allowing the identification of indirect interactions to vary with ecological context based on CTMM outputs. We assessed the performance of our new method using simulations and illustrated its implementation by deriving disease-relevant interaction networks for two behaviorally differentiated species, wild pigs (Sus scrofa) that can host African Swine Fever and mule deer (Odocoileus hemionus) that can host chronic wasting disease. Simulations showed that interactions derived from observed GPS data can be substantially underestimated when temporal resolution of movement data exceeds 30-min intervals. Empirical application suggested that underestimation occurred in both interaction rates and their spatial distributions. CTMM-Interaction method, which can introduce uncertainties, recovered majority of true interactions. Our method leverages advances in movement ecology to quantify fine-scale spatiotemporal interactions between individuals from lower temporal resolution GPS data. It can be leveraged to infer dynamic social networks, transmission potential in disease systems, consumer–resource interactions, information sharing, and beyond. The method also sets the stage for future predictive models linking observed spatiotemporal interaction patterns to environmental drivers