Celmanbet, Ömür
M.S., Mathematics
Supervisor : Prof. Dr. Mehpare Bilhan
Co-supervisor : Prof. Dr. Semih Koray
September 1999, 55 pages
In this thesis, we study the characterization of implementability
of social choice rule in certain noncooperative soution concepts. First
we give surveys on Nash and
subgame perfect implementability. We also attempt to characterize Stackelberg
implementability, where we come up with certain necessary conditions for
implementation according to this solution concept.
Keywords : Social choice rule, game form (mechanism), implementation.