Stability property of matchings is a natural solution concept in coalitional market games

Stability of matchings was proved to be a new cooperative equilibrium concept in Sotomayor (Dynamics and equilibrium: essays in honor to D. Gale, 1992). That paper introduces the innovation of treating as multi-dimensional the payoff of a player with a quota greater than one. This is done for the many-to-many matching model with additively separable utilities, for which the stability concept is defined. It is then proved, via linear programming, that the set of stable outcomes is nonempty and it may be strictly bigger than the set of dual solutions and strictly smaller than the core. The present paper defines a general concept of stability and shows that this concept is a natural solution concept, stronger than the core concept, for a much more general coalitional game than a matching game. Instead of mutual agreements inside partnerships, the players are allowed to make collective agreements inside coalitions of any size and to distribute his labor among them. A collective agreement determines the level of labor at which the coalition operates and the division, among its members, of the income generated by the coalition. An allocation specifies a set of collective agreements for each player.

Corrigendum stable matchings and preferences of couples

We correct an omission in the definition of our domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

Manipulation of optimal matchings via predonation of endowment

In this paper we answer a question posed by Sertel and Özkal-Sanver (2002) on the manipulability of optimal matching rules in matching problems with endowments. We characterize the classes of consumption rules under which optimal matching rules can be manipulated via predonation of endowment.

Some things couples always wanted to know about stable matchings (but were afraid to ask)

It is well-known that couples that look jointly for jobs in the same centralized labor market may cause instabilities. We demonstrate that for a natural preference domain for couples, namely the domain of responsive preferences, the existence of stable matchings can easily be established. However, a small deviation from responsiveness in one couple's preference relation that models the wish of a couple to be closer together may already cause instability. This demonstrates that the nonexistence of stable matchings in couples markets is not a singular theoretical irregularity. Our nonexistence result persists even when a weaker stability notion is used that excludes myopic blocking. Moreover, we show that even if preferences are responsive there are problems that do not arise for singles markets. Even though for couples markets with responsive preferences the set of stable matchings is nonempty, the lattice structure that this set has for singles markets does not carry over. Furthermore we demonstrate that the new algorithm adopted by the National Resident Matching Program to fill positions for physicians in the United States may cycle, while in fact a stable matchings does exist, and be prone to strategic manipulation if the members of a couple pretend to be single.

Corrigendum: stable matchings and preferences of couples

We correct an omission in the definition of the domain of weakly responsive preferences introduced in Klaus and Klijn (2005) or KK05 for short. The proof of the existence of stable matchings (KK05, Theorem 3.3) and a maximal domain result (KK05, Theorem 3.5) are adjusted accordingly.

Detection of matchings in a sequence of underwater images through texture analysis

This paper presents an approach to ameliorate the reliability of the correspondence points relating two consecutive images of a sequence. The images are especially difficult to handle, since they have been acquired by a camera looking at the sea floor while carried by an underwater robot. Underwater images are usually difficult to process due to light absorption, changing image radiance and lack of well-defined features. A new approach based on gray-level region matching and selective texture analysis significantly improves the matching reliability

Detection of matchings in a sequence of underwater images through texture analysis

This paper presents an approach to ameliorate the reliability of the correspondence points relating two consecutive images of a sequence. The images are especially difficult to handle, since they have been acquired by a camera looking at the sea floor while carried by an underwater robot. Underwater images are usually difficult to process due to light absorption, changing image radiance and lack of well-defined features. A new approach based on gray-level region matching and selective texture analysis significantly improves the matching reliability

Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size

Let k and l be positive integers. With a graph G, we associate the quantity c(k,l)(G), the number of k-colourings of the edge set of G with no monochromatic matching of size l. Consider the function c(k,l) : N --> N given by c(k,l)(n) = max {c(k,l)(G): vertical bar V(G)vertical bar = n}, the maximum of c(k,l)(G) over all graphs G on n vertices. In this paper, we determine c(k,l)(n) and the corresponding extremal graphs for all large n and all fixed values of k and l.

Matchings and phylogenetic trees

This paper presents a natural coordinate system for phylogenetic trees using a correspondence with the set of perfect matchings in the complete graph. This correspondence produces a distance between phylogenetic trees, and a way of enumerating all trees in a minimal step order. It is useful in randomized algorithms because it enables moves on the space of trees that make random optimization strategies “mix” quickly. It also promises a generalization to intermediary trees when data are not decisive as to their choice of tree, and a new way of constructing Bayesian priors on tree space.

Assigning Refugees to Landlords in Sweden: Stable Maximum Matchings

This version: August 15, 2017 (original version: December 7, 2016)

Assigning Refugees to Landlords in Sweden: Stable Maximum Matchings

The member states of the European Union received 1.2 million first time asylum applications in 2015 (a doubling compared to 2014). Even if asylum will be granted for many of the refugees that made the journey to Europe, several obstacles for successful integration remain. This paper focuses on one of these obstacles, namely the problem of finding housing for refugees once they have been granted asylum. In particular, the focus is restricted to the situation in Sweden during 2015–2016 and it is demonstrated that market design can play an important role in a partial solution to the problem. More specifically, because almost all accommodation options are exhausted in Sweden, the paper investigates a matching system, closely related to the system adopted by the European NGO “Refugees Welcome”, and proposes an easy-to-implement algorithm that finds a stable maximum matching. Such matching guarantees that housing is provided to a maximum number of refugees and that no refugee prefers some landlord to their current match when, at the same time, that specific landlord prefers that refugee to his current match.

Rotation-discriminating template matching based on Fourier coefficients of radial projections with robustness to scaling and partial occlusion

We consider brightness/contrast-invariant and rotation-discriminating template matching that searches an image to analyze A for a query image Q We propose to use the complex coefficients of the discrete Fourier transform of the radial projections to compute new rotation-invariant local features. These coefficients can be efficiently obtained via FFT. We classify templates in ""stable"" and ""unstable"" ones and argue that any local feature-based template matching may fail to find unstable templates. We extract several stable sub-templates of Q and find them in A by comparing the features. The matchings of the sub-templates are combined using the Hough transform. As the features of A are computed only once, the algorithm can find quickly many different sub-templates in A, and it is Suitable for finding many query images in A, multi-scale searching and partial occlusion-robust template matching. (C) 2009 Elsevier Ltd. All rights reserved.