Skip to main content

Resultados relacionados

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

Dipòsit Digital de Documents de la UAB
Publication 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