Another direct proof of the Gibbard–Satterthwaite Theorem

This paper provides a new and direct proof of the Gibbard–Satterthwaite Theorem based on induction on the number of individuals.     

Extensive Form Implementation in Incomplete Information Environments

We study the implementation of social choice rules in incomplete information environments. A sufficiency condition calledposterior reversalis given for extensive form implementation. The condition has a natural interpretation in signaling terms: Consistent posterior distributions under truth-telling are different from consistent posteriors under deception. This variation in the distribution over player types leads to variation in the distribution over actions and outcomes (comparing truth-telling and deception). We exploit this feature to implement social choice rules.Journal of Economic LiteratureClassification Numbers: D78, D82.     

Tops-only domains

In this paper we consider the standard voting model with a finite set of alternatives A and n voters and address the following question: what are the characteristics of domains \({\mathcal D}\) that induce the property that every strategy-proof social choice function \({f: {\mathcal D}^n \rightarrow A}\) satisfying unanimity, has the tops-only property? We first impose a minimal richness condition which ensures that for every alternative a, there exists an admissible ordering where a is maximal. We identify conditions on \({\mathcal D}\) that are sufficient for strategy-proofness and unanimity to imply tops onlyness in the general case of n voters and in the special case, n = 2. We provide an algorithm for constructing tops-only domains from connected graphs with elements of A as nodes. We provide several applications of our results. Finally, we relax the minimal richness assumption and partially extend our results.     

Dictatorial domains

Summary. In this paper, we introduce the notion of a linked domain and prove that a non-manipulable social choice function defined on such a domain must be dictatorial. This result not only generalizes the Gibbard-Satterthwaite Theorem but also demonstrates that the equivalence between dictatorship and non-manipulability is far more robust than suggested by that theorem. We provide an application of this result in a particular model of voting. We also provide a necessary condition for a domain to be dictatorial and use it to characterize dictatorial domains in the cases where the number of alternatives is three. Received: July 12, 2000; revised version: March 21, 2002 RID="*" ID="*" The authors would like to thank two anonymous referees for their detailed comments. Correspondence to: A. Sen     

Subgame perfect implementation: A necessary and almost sufficient condition

We present a necessary and almost sufficient condition for subgame perfect implementation of social choice correspondences. In societies with at least three individuals, any social choice correspondence which satisfies no veto power and our necessary Condition α is subgame perfect implementable. Thus Condition α is analogous to monotonicity which, by Maskin's celebrated characterization, is necessary and, in a similar way, almost sufficient for Nash implementation.