T. Walsh

  1. Dual Modelling of Permutation and Injection Problems.

    Authors: T. Walsh, B. Hnich, B. M. Smith
    Subjects: Artificial Intelligence
    Abstract

    When writing a constraint program, we have to choose which variables should
    be the decision variables, and how to represent the constraints on these
    variables. In many cases, there is considerable choice for the decision
    variables. Consider, for example, permutation problems in which we have as many
    values as variables, and each variable takes an unique value. In such problems,
    we can choose between a primal and a dual viewpoint. In the dual viewpoint,
    each dual variable represents one of the primal values, whilst each dual value
    represents one of the primal variables.

  2. Local search for stable marriage problems.

    Authors: M. Gelain, M. S. Pini, F. Rossi, K. B. Venable, T. Walsh
    Subjects: Artificial Intelligence
    Abstract

    The stable marriage (SM) problem has a wide variety of practical
    applications, ranging from matching resident doctors to hospitals, to matching
    students to schools, or more generally to any two-sided market. In the
    classical formulation, n men and n women express their preferences (via a
    strict total order) over the members of the other sex. Solving a SM problem
    means finding a stable marriage where stability is an envy-free notion: no man
    and woman who are not married to each other would both prefer each other to
    their partners or to being single.

Syndicate content