This paper analyzes the use of a version of lexical maximim strategies, called protective behavior, in two-sided matching models. It restricts attention to mechanisms which produce stable matchings, that is, matchings which are individually rational and pairwise optimal. The main results of the...

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

A social choice function may or may not satisfy a desirable property depending on its domain of definition. For the same reason, different conditions may be equivalent for functions defined on some domains, while not in other cases. Understanding the role of domains is therefore a crucial issue...

When members of a voting body exhibit single peaked preferences, pair-wise majority voting equilibria (Condorcet winners) always exist. Moreover, they coincide with the median(s) of the votersʼ most preferred alternatives. This important fact is known as the median voter result. Variants of it...