A social choice hyperfunction picks a non-empty set of alternatives at each admissible preference profile over sets of alternatives. We analyze the manipulability of social choice hyperfunctions. We identify a domain D[lambda] of lexicographic orderings which exhibits an impossibility of the Gibbard-Satterthwaite type. Moreover, this impossibility is inherited by all well-known superdomains of D[lambda]. As most of the standard extension axioms induce superdomains of D[lambda] while social choice correspondences are particular social choice hyperfunctions, we are able to generalize many impossibility results in the literature.
Download Info
To download:
If you experience problems downloading a file, check if you have the
proper application to
view it first. Information about this may be contained
in the File-Format links below. In case of further problems read
the IDEAS help
page. Note that these files are not on the IDEAS
site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Volume (Year): 66 (2009) Issue (Month): 2 (July) Pages: 880-892 Download reference. The following formats are available: HTML
(with abstract),
plain text
(with abstract),
BibTeX,
RIS (EndNote, RefMan, ProCite),
ReDIF