This comment corrects the errors in the estimation process that appear in Martins (2001). The first error is in the parametric probit estimation, as the previously presented results do not maximize the log-likelihood function. In the global maximum more variables become significant. As for 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...

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

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

Barberà and Coelho (2006) documented six screening rules associated with the rule of k names that are used by different institutions around the world. Here, we study whether these screening rules satisfy stability. A set is said to be a weak Condorcet set la Gehrlein (1985) if no candidate in...

Rules of k names are frequently used methods to appoint individuals to office. They are two-stage procedures where a first set of agents, the proposers, select k individuals from an initial set of candidates, and then another agent, the chooser, appoints one among those k in the list. In...