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.

Median stable matching for college admission

We give a simple and concise proof that so-called generalized median stable matchings are well-defined stable matchings for college admissions problems. Furthermore, we discuss the fairness properties of median stable matchings and conclude with two illustrative examples of college admissions markets, the lattices of stable matchings, and the corresponding generalized median stable matchings.

Choosing how to choose: self-stable majority rules and constitutions

Constitutional arrangements affect the decisions made by a society. We study how this effect leads to preferences of citizens over constitutions; and ultimately how this has a feedback that determines which constitutions can survive in a given society. Constitutions are stylized here, to consist of a voting rule for ordinary business and possibly different voting rule for making changes to the constitution. We deffine an equilibrium notion for constitutions, called self-stability, whereby under the rules of a self-stable constitution, the society would not vote to change the constitution. We argue that only self-stable constitutions will endure. We prove that self-stable constitutions always exist, but that most constitutions (even very prominent ones) may not be self-stable for some societies. We show that constitutions where the voting rule used to amend the constitution is the same as the voting rule used for ordinary business are dangerously simplistic, and there are (many) societies for which no such constitution is self-stable rule. We conclude with a characterization of the set of self-stable constitutions that use majority rule for ordinary business.

Procedurally fair and stable matching

We motivate procedural fairness for matching mechanisms and study two procedurally fair and stable mechanisms: employment by lotto (Aldershof et al., 1999) and the random order mechanism (Roth and Vande Vate, 1990, Ma, 1996). For both mechanisms we give various examples of probability distributions on the set of stable matchings and discuss properties that differentiate employment by lotto and the random order mechanism. Finally, we consider an adjustment of the random order mechanism, the equitable random order mechanism, that combines aspects of procedural and "endstate'' fairness. Aldershof et al. (1999) and Ma (1996) that exist on the probability distribution induced by both mechanisms. Finally, we consider an adjustment of the random order mechanism, the equitable random order mechanism.

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.

Stable condorcet rules

We consider the following allocation problem: A fixed number of public facilities must be located on a line. Society is composed of $N$ agents, who must be allocated to one and only one of these facilities. Agents have single peaked preferences over the possible location of the facilities they are assigned to, and do not care about the location of the rest of facilities. There is no congestion. In this context, we observe that if a public decision is a Condorcet winner, then it satisfies nice properties of internal and external stability. Though in many contexts and for some preference profiles there may be no Condorcet winners, we study the extent to which stability can be made compatible with the requirement of choosing Condorcet winners whenever they exist.

Stable coalition structures with fixed decision scheme

This paper studies the stability of a finite local public goods economy in horizontal differentiation, where a jurisdiction's choice of the public good is given by an exogenous decision scheme. In this paper, we characterize the class of decision schemes that ensure the existence of an equilibrium with free mobility (that we call Tiebout equilibrium) for monotone distribution of players. This class contains all the decision schemes whose choice lies between the Rawlsian decision scheme and the median voter with mid-distance of the two median voters when there are ties. We show that for non-monotone distribution, there is no decision scheme that can ensure the stability of coalitions. In the last part of the paper, we prove the non-emptiness of the core of this coalition formation game

Stable rank of leavitt path algebra

We characterize the values of the stable rank for Leavitt path algebras, by giving concrete criteria in terms of properties of the underlying graph.

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.

Efficient and stable collective choices under gregarious preferences

We consider collective choice problems where a set of agents have to choose an alternative from a finite set and agents may or may not become users of the chosen alternative. An allocation is a pair given by the chosen alternative and the set of its users. Agents have gregarious preferences over allocations: given an allocation, they prefer that the set of users becomes larger. We require that the final allocation be efficient and stable (no agent can be forced to be a user and no agent who wants to be a user can be excluded). We propose a two-stage sequential mechanism whose unique subgame perfect equilibrium outcome is an efficient and stable allocation which also satisfies a maximal participation property.

Stable stationary states of non-local interaction equations

"Vegeu el resum a l'inici del document del fitxer adjunt."

Potential isomorphism of elementary substructures of a strictly stable homogeneous model

"Vegeu el resum a l'inici del document del fitxer adjunt."

The generator problem for Z-stable C*-algebras

The generator problem was posed by Kadison in 1967, and it remains open until today. We provide a solution for the class of C*-algebras absorbing the Jiang-Su algebra Z tensorially. More precisely, we show that every unital, separable, Z-stable C*-algebra A is singly generated, which means that there exists an element x є A that is not contained in any proper sub-C*- algebra of A. To give applications of our result, we observe that Z can be embedded into the reduced group C*-algebra of a discrete group that contains a non-cyclic, free subgroup. It follows that certain tensor products with reduced group C*-algebras are singly generated. In particular, C*r (F ∞) ⨂ C*r (F ∞) is singly generated.

A compositional approach to stable isotope data analysis

Isotopic data are currently becoming an important source of information regardingsources, evolution and mixing processes of water in hydrogeologic systems. However, itis not clear how to treat with statistics the geochemical data and the isotopic datatogether. We propose to introduce the isotopic information as new parts, and applycompositional data analysis with the resulting increased composition. Results areequivalent to downscale the classical isotopic delta variables, because they are alreadyrelative (as needed in the compositional framework) and isotopic variations are almostalways very small. This methodology is illustrated and tested with the study of theLlobregat River Basin (Barcelona, NE Spain), where it is shown that, though verysmall, isotopic variations comp lement geochemical principal components, and help inthe better identification of pollution sources