The problem of social choice is studied on a domain with countably many individuals. In contrast to most of the existing literature which establish either non-constructive possibilities or approximate (i.e. invisible) dictators, we show that if one adds a continuity property to the usual set of axioms, the classical impossibilities persist in countable societies. Along the way, a new proof of the Gibbard–Satterthwaite theorem in the style of Peter Fishburn’s well known proof of Arrow’s impossibility theorem is obtained.
CITATION STYLE
Ninjbat, U. (2018). Impossibility theorems with countably many individuals. SERIEs, 9(3), 333–350. https://doi.org/10.1007/s13209-018-0182-4
Mendeley helps you to discover research relevant for your work.