It is proved that, among all restricted preference domains that guarantee consistency (i.e. transitivity) of pairwise majority voting, the single-peaked domain is the only minimally rich and connected domain that contains two completely reversed strict preference orders. It is argued that this...

We prove a negative result in repeated games which shows that a sizable part of the set of feasible individually rational payoffs can never be supported by strategies that are at all robust to players' discount factors. We find the cutoff defining this region and interpret it as a limit on the...

In this paper the concepts of manipulation as strategic voting (misrepresentation of true preferences) and strategic nomination (by adding, or removing alternatives) are investigated. The connection between Arrow’s and Gibbard-Satterthwaite theorems is discussed from the viewpoint of dilemma...