We provide an axiomatic characterization of a family of criteria for ranking completely uncertain decisions. A completely uncertain decision is described by the set of all its consequences (assumed to be finite). Each of the criterions characterized can be thought of as assigning to all...

In this paper, we investigate domains which admit "well-behaved", strategy-proof social choice functions. We show that if the number of voters is even, then every domain that satisfies a richness condition and admits an anonymous, tops-only, unanimous and strategy-proof social choice function,...

We investigate the problem of Nash implementation in the presence of "partially honest" individuals. A partially honest player is one who has a strict preference for revealing the true state over lying when truthtelling does not lead to a worse outcome (according to preferences in the true...

We study strategic voting after weakening the notion of strategy-proofness to Ordinal Bayesian Incentive Compatibility (OBIC). Under OBIC, truthelling is required to maximize the expected utility being computed with respect to the voter's prior beliefs and under the assumption that everybody...

We study strategic voting after weakening the notion of strategy-proofness to Ordinal Bayesian Incentive Compatibility (OBIC). Under OBIC, truth-telling is required to maximize the expected utility of every voter, expected utility being computed with respect to the voter's prior beliefs and...

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 D that induce the property that every strategy-proof social choice function f : Dn ! A satisfying unanimity, has the...