The rule of k names can be described as follows: given a set of candidates for office, a committee chooses k members from this set by voting, and makes a list with their names. Then a single individual from outside the committee selects one of the listed names for the office. Different variants...

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...

In this note we show that no solution to coalition formation games can satisfy a set of axioms that we propose as reasonable. Our result points out that “solutions” to the coalition formation cannot be interpreted as predictions of what would be “resting points” for a game in the way...

The rule of k names can be described as follows: given a set of candidates for office, a committee chooses k members from this set by voting, and makes a list with their names. Then a single individual from outside the committee selects one of the listed names for the office. Different variants...

Qin [J. Eco. Th., 1996] recently showed that in a game of endogenous formation of cooperation structure, if the underlying TU-game is superadditive, then the full cooperation structure is stable. In this note, we characterize the class of games that ensure the stability of the full cooperation...

This paper analyzes the different compositions of the catalan governing coalitions during the current democratic period, and offers some predictions about the coalitions that can be expected in the future. During this period, in catalan politics, there have been two main political issues over...

We consider one-to-one matching (roommate) problems in which agents (students) can either be matched as pairs or remain single. The aim of this paper is twofold. First, we review a key result for roommate problems (the ``lonely wolf'' theorem) for which we provide a concise and elementary proof....

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...

We study the problem of a society choosing a subset of new members from a finite set of candidates (as in Barber?Sonnenschein, and Zhou, 1991). However, we explicitly consider the possibility that initial members of the society (founders) may want to leave it if they do not like the resulting...

The proposed game is a natural extension of the Shapley and Shubik Assignment Game to the case where each seller owns a set of different objets instead of only one indivisible object. We propose definitions of pairwise stability and group stability that are adapted to our framework. Existence of...