Paired and altruistic kidney donation in the UK: Algorithms and experimentation

We study the computational problem of identifying optimal sets of kidney exchanges in the UK. We show how to expand an integer programming-based formulation due to Roth et al. [2007] in order to model the criteria that constitute the UK definition of optimality. The software arising from this work has been used by the National Health Service Blood and Transplant to find optimal sets of kidney exchanges for their National Living Donor Kidney Sharing Schemes since July 2008. We report on the characteristics of the solutions that have been obtained in matching runs of the scheme since this time. We then present empirical results arising from experiments on the real datasets that stem from these matching runs, with the aim of establishing the extent to which the particular optimality criteria that are present in the UK influence the structure of the solutions that are ultimately computed. A key observation is that allowing four-way exchanges would be likely to lead to a moderate number of additional transplants

Student-Project Allocation with Preferences over Projects

We study the problem of allocating students to projects, where both students and lecturers have preferences over projects, and both projects and lecturers have capacities. In this context we seek a stable matching of students to projects, which respects these preference and capacity constraints. Here, the stability definition generalises the corresponding notion in the context of the classical Hospitals / Residents problem. We show that stable matchings can have different sizes, and the problem of finding a maximum cardinality stable matching is NP-hard, though approximable within a factor of 2

Modelling and Solving the Stable Marriage Problem Using Constraint Programming

We study the Stable Marriage problem (SM), which is a combinatorial problem that arises in many practical applications. We present two new models of an instance I of SM with n men and n women as an instance J of a Constraint Satisfaction Problem. We prove that establishing arc consistency in J yields the same structure as given by the established Extended Gale/Shapley algorithm for SM as applied to I. Consequently, a solution (stable matching) of I can be derived without search. Furthermore we show that, in both encodings, all stable matchings in I may be enumerated in a failure-free manner. Our first encoding is of O(n^3) complexity and is very natural, whilst our second model, of O(n^2) complexity (which is optimal), is a development of the Boolean encoding in [6], establishing a greater level of structure

A Bayesian Approach to Deriving Ages of Individual Field White Dwarfs

We apply a self-consistent and robust Bayesian statistical approach to determining the ages, distances, and ZAMS masses of 28 field DA white dwarfs with ages of approximately 4 to 8 Gyrs. Our technique requires only quality optical and near-IR photometry to derive ages with < 15% uncertainties, generally with little sensitivity to our choice of modern initial-final mass relation. We find that age, distance, and ZAMS mass are correlated in a manner that is too complex to be captured by traditional error propagation techniques. We further find that the posterior distributions of age are often asymmetric, indicating that the standard approach to deriving WD ages can yield misleading results.Comment: 9 pages, 10 figures, accepted for publication in Ap

Stable Marriage with Ties and Bounded Length Preference Lists

We consider variants of the classical stable marriage problem in which preference lists may contain ties, and may be of bounded length. Such restrictions arise naturally in practical applications, such as centralised matching schemes that assign graduating medical students to their first hospital posts. In such a setting, weak stability is the most common solution concept, and it is known that weakly stable matchings can have different sizes. This motivates the problem of finding a maximum cardinality weakly stable matching, which is known to be NP-hard in general. We show that this problem is solvable in polynomial time if each man's list is of length at most 2 (even for women's lists that are of unbounded length). However if each man's list is of length at most 3, we show that the problem becomes NP-hard and not approximable within some d &gt; 1, even if each woman's list is of length at most 4

A Constraint Programming Approach to the Hospitals / Residents Problem

An instance I of the Hospitals / Residents problem (HR) involves a set of residents (graduating medical students) and a set of hospitals, where each hospital has a given capacity. The residents have preferences for the hospitals, as do hospitals for residents. A solution of I is a stable matching, which is an assignment of residents to hospitals that respects the capacity conditions and preference lists in a precise way. In this paper we present constraint encodings for HR that give rise to important structural properties. We also present a computational study using both randomly-generated and real-world instances. Our study suggests that Constraint Programming is indeed an applicable technology for solving this problem, in terms of both theory and practice

Assessing the impact of deliberation and information on opinion change: a quasi-experiment in public deliberation

Deliberative democracy has become fashionable for many and it has been used in some places to solve real-world policy problems. However measuring the ‘success’ of deliberative democracy is not clearly achievable. For most ‘success’ is measured in terms of opinion change, but these are only rarely measured against control groups, and in particular there is no way of knowing if the opinion change took place because of the deliberation or because of information they received through the deliberation process. Exercises in deliberation seem to represent one big treatment. But we would want to separate out the component parts of the treatment. This paper outlines the results of an experiment in which deliberation took place in a pilot Citizens’ Assembly in Ireland. As part of this we measured the impact using pre and post-test controls, including a control group given the information the CA participants received, but without the deliberation. The results of the experiment reveal that there is a deliberation effect separate to the information effect