Pasar al contenido principal

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

Dipòsit Digital de Documents de la UAB
Publicación Artículo científico (JournalArticle)

Sequential voting and agenda manipulation

  • Barberà, Salvador|||0000-0001-6586-2398
  • Gerber, Anke|||0000-0001-6069-9296
We study the possibilities for agenda manipulation under strategic voting for two prominent sequential voting procedures: the amendment procedure and the successive procedure. We show that a well known result for tournaments, namely that the successive procedure is (weakly) more manipulable than the amendment procedure at any given preference profile, extends to arbitrary majority quotas. Moreover, our characterizations of the attainable outcomes for arbitrary quotas allow us to compare the possibilities for manipulation across different quotas. It turns out that the simple majority quota maximizes the domain of preference profiles for which neither procedure is manipulable, but at the same time neither the simple majority quota nor any other quota uniformly minimizes the scope of manipulation once this becomes possible. Hence, quite surprisingly, simple majority voting is not necessarily the optimal choice of a society that is concerned about agenda manipulation.
Dipòsit Digital de Documents de la UAB
Publicación Artículo preliminar (WorkingPaper)

Top monotonicity, a common root for single peakedness, single crossing and the median voter result

  • Barberà, Salvador|||0000-0001-6586-2398
  • Moreno, Bernardo|||0000-0003-0651-4427
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 also apply when single-peakedness fails, but preferences verify other domain restrictions, such as single-crossing, intermediateness or order restriction. Austen-Smith and Banks (1999) also proved that the result holds under single-peakedness, for a wide class of voting rules that includes the majority rule as a special case, and conveniently redefined versions of a median. We extend and unify previous results. We propose a new domain condition, called top monotonicity, which encompasses all previous domains restrictions, allows for new ones and preserves a version of the median voter result for a large class of voting rules. We also show that top monotonicity arises in interesting economic environments.
Dipòsit Digital de Documents de la UAB
Publicación Artículo preliminar (WorkingPaper)

Domains, ranges and strategy-proofness, the case of single-dipped preferences

  • Barberà, Salvador|||0000-0001-6586-2398
  • Berga, Dolors|||0000-0002-4873-7904
  • Moreno, Bernardo|||0000-0003-0651-4427
We characterize the set of all individual and group strategy-proof rules on the domain of all single-dipped preferences on a line. For rules defined on this domain, and on several of its subdomains, we explore the implications of these strategy-proofness requirements on the maximum size of the rules' range. We show that when all single-dipped preferences are admissible, the range must contain two alternatives at most. But this bound changes as we consider different subclasses of single-dipped preferences: we provide examples of subdomains admitting strategy-proof rules with larger ranges. We establish exact bounds on the maximal size of strategy-proof functions on each of these domains, and prove that the relationship between the sizes of the subdomains and those of the ranges of strategy-proof functions on them need not be monotonic. Our results exhibit a sharp contrast between the structure of strategy-proof rules defined on subdomains of single-dipped preferences and those defined on subsets of single-peaked ones
Dipòsit Digital de Documents de la UAB
Publicación Artículo preliminar (WorkingPaper)

Comparing generalized median voter schemes according to their manipulability

  • Arribillaga, R. Pablo|||0000-0002-0521-0301
  • Massó, Jordi|||0000-0003-3712-0041
We propose a simple criterion to compare generalized median voter schemes according to their manipulability. We identify three necessary and sufficient conditions for the comparability of two generalized median voter schemes in terms of their vulnerability to manipulation. The three conditions are stated using the two associated families of monotonic fixed ballots and depend very much on the power each agent has to unilaterally change the outcomes of the two generalized median voter schemes. We perform a specific analysis of all median voter schemes: the anonymous subfamily of generalized median voter schemes.