Rank Maximal Matchings -- Structure and Algorithms

Let G = (A U P, E) be a bipartite graph where A denotes a set of agents, P denotes a set of posts and ranks on the edges denote preferences of the agents over posts. A matching M in G is rank-maximal if it matches the maximum number of applicants to their top-rank post, subject to this, the maximum number of applicants to their second rank post and so on. In this paper, we develop a switching graph characterization of rank-maximal matchings, which is a useful tool that encodes all rank-maximal matchings in an instance. The characterization leads to simple and efficient algorithms for several interesting problems. In particular, we give an efficient algorithm to compute the set of rank-maximal pairs in an instance. We show that the problem of counting the number of rank-maximal matchings is #P-Complete and also give an FPRAS for the problem. Finally, we consider the problem of deciding whether a rank-maximal matching is popular among all the rank-maximal matchings in a given instance, and give an efficient algorithm for the problem

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

Modeling Stable Matching Problems with Answer Set Programming

The Stable Marriage Problem (SMP) is a well-known matching problem first introduced and solved by Gale and Shapley (1962). Several variants and extensions to this problem have since been investigated to cover a wider set of applications. Each time a new variant is considered, however, a new algorithm needs to be developed and implemented. As an alternative, in this paper we propose an encoding of the SMP using Answer Set Programming (ASP). Our encoding can easily be extended and adapted to the needs of specific applications. As an illustration we show how stable matchings can be found when individuals may designate unacceptable partners and ties between preferences are allowed. Subsequently, we show how our ASP based encoding naturally allows us to select specific stable matchings which are optimal according to a given criterion. Each time, we can rely on generic and efficient off-the-shelf answer set solvers to find (optimal) stable matchings.Comment: 26 page

Integer programming methods for special college admissions problems

We develop Integer Programming (IP) solutions for some special college admission problems arising from the Hungarian higher education admission scheme. We focus on four special features, namely the solution concept of stable score-limits, the presence of lower and common quotas, and paired applications. We note that each of the latter three special feature makes the college admissions problem NP-hard to solve. Currently, a heuristic based on the Gale-Shapley algorithm is being used in the application. The IP methods that we propose are not only interesting theoretically, but may also serve as an alternative solution concept for this practical application, and also for other ones

Counting Popular Matchings in House Allocation Problems

We study the problem of counting the number of popular matchings in a given instance. A popular matching instance consists of agents A and houses H, where each agent ranks a subset of houses according to their preferences. A matching is an assignment of agents to houses. A matching M is more popular than matching M' if the number of agents that prefer M to M' is more than the number of people that prefer M' to M. A matching M is called popular if there exists no matching more popular than M. McDermid and Irving gave a poly-time algorithm for counting the number of popular matchings when the preference lists are strictly ordered. We first consider the case of ties in preference lists. Nasre proved that the problem of counting the number of popular matching is #P-hard when there are ties. We give an FPRAS for this problem. We then consider the popular matching problem where preference lists are strictly ordered but each house has a capacity associated with it. We give a switching graph characterization of popular matchings in this case. Such characterizations were studied earlier for the case of strictly ordered preference lists (McDermid and Irving) and for preference lists with ties (Nasre). We use our characterization to prove that counting popular matchings in capacitated case is #P-hard

A new paradigm evaluating cost per cure of HCV infection in the UK

Background: New interferon (IFN)-free treatments for hepatitis C are more effective, safer but more expensive than current IFN-based therapies. Comparative data of these, versus current first generation protease inhibitors (PI) with regard to costs and treatment outcomes are needed. We investigated the real-world effectiveness, safety and cost per cure of 1st generation PI-based therapies in the UK. Methods: Medical records review of patients within the HCV Research UK database. Patients had received treatment with telaprevir or boceprevir and pegylated interferon and ribavirin (PR). Data on treatment outcome, healthcare utilisation and adverse events (AEs) requiring intervention were collected and analysed overall and by subgroups. Costs of visits, tests, therapies, adverse events and hospitalisations were estimated at the patient level. Total cost per cure was calculated as total median cost divided by SVR rate. Results: 154 patients from 35 centres were analysed. Overall median total cost per cure was £44,852 (subgroup range,: £35,492 to £107,288). Total treatment costs were accounted for by PI: 68.3 %, PR: 26.3 %, AE management: 5.4 %. Overall SVR was 62.3 % (range 25 % to 86.2 %). 36 % of patients experienced treatment-related AEs requiring intervention, 10 % required treatment-related hospitalisation. Conclusions: This is the first UK multicentre study of outcomes and costs of PI-based HCV treatments in clinical practice. There was substantial variation in total cost per cure among patient subgroups and high rates of treatment-related discontinuations, AEs and hospitalisations. Real world safety, effectiveness and total cost per cure for the new IFN free combinations should be compared against this baseline

Calculation of Finite Size Effects on the Nucleon Mass in Unquenched QCD using Chiral Perturbation Theory

The finite size effects on nucleon masses are calculated in relativistic chiral perturbation theory. Results are compared with two-flavor lattice results.Comment: talk at Confinement03, 5 pages latex, 3 figures. Assignment of 2 data points to incorrect data sets in plot 1 and of 1 data point in plot 2 corrected. 1 fm lattice result updated. Conclusions unchange