Browsing by Subject "Social Choice Theory"

Now showing 1 - 3 of 3

Open Access
Cloning-proof social choice correspondences
(2011) Öztürk, Zeliha Emel
In this thesis study, we provide axiomatic characterizations of the well-known Condorcet and Plurality rules via consistency axioms when the alternative set is endogeneous, namely hereditariness and cloning-proofness. Cloningproofness is the requirement that the social choice rule be insensitive to the replication of alternatives, whereas hereditariness requires insensitivity to withdrawal of alternatives.
Open Access
Essays in social choice theory
(2009) Erol, Selman
In this thesis, we investigate several issues concerning the class of Maskin monotonic social choice rules. Firstly, given a set of profiles, we find out which Maskin monotonic social choice rules adopt this set as a center. Then we introduce an algorithmic approach to find the self-monotonicities of a Maskin monotonic social choice rule. Moreover, we characterize all binary set operations that preserve Maskin monotonicity. Then we pass to investigating social choice functions, and determine the the domains of impossibility and possibility around a center with respect to a modified Manhattan metric. Finally, we try to reach a necessary and sufficient condition for Nash-implementability of a social choice in terms of neutrality
Open Access
Preservation of implementability under algebraic operations
(2011) Doğan, Serhat
In this thesis, we investigate whether union and intersection preserve Nash and subgame perfect implementability. Nash implementability is known to be preserved under union. Here we first show that, under some reasonably mild assumptions, Nash implementability is also preserved under intersection. The conjunction of these two results yields an almost lattice-like structure for Nash implementable social choice rules. Next, we carry over these results to subgame perfect implementability by employing similar arguments. Finally, based on the fact that Nash implementable social choice rules are closed under union, we provide a new characterization of Nash implementability, which also exemplifies the potential use of our findings for further research.