On enforcing socially best alternatives of binary group decision rules (Q1081509)

Within a cooperative framework it is shown that voting by successive amendments can enforce group decision rules (GDR) belonging to a certain class under the concept of strong equilibrium. For GDR's from another class it is shown that if individuals have linear orderings, then whenever there is a unique pairwise-best alternative, this must be the unique outcome in the core of game forms in which strategy sets are preference orderings. Within the non-cooperative case for certain GDR's it is shown that if individual preferences are strict, then the sophisticated equilibrium outcome of voting by sequential elimination is always Pareto efficient.