We investigate implementation in the complete information environments, where a social choice function is defined as a mapping from states to lotteries, and there exist four or more agents. We assume that for every agent, any pair of distinct states induces distinct strict preference orderings over all pure alternatives. In contrast to the previous works, we construct only direct mechanisms. Without any help of mechanism complexity, we can show that every social choice function is virtually implementable, provided that the set of states is restricted in ways that there always exist a majority of agents who dislike a particular agentfs dictatorial choice the worst.
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.
Publisher Info
Paper provided by CIRJE, Faculty of Economics, University of Tokyo in its series CIRJE F-Series with number
CIRJE-F-149.
References listed on IDEAS Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.: