A social choice function is group strategy-proof on a domain if no group of agents can manipulate its final outcome to their own benefit by declaring false preferences on that domain. There are a number of economically significant domains where interesting rules satisfying individual...

We provide characterizations of the set of outcomes that can be achieved by agenda manipulation for two prominent sequential voting procedures, the amendment and the successive procedure. Tournaments and super-majority voting with arbitrary quota q are special cases of the general sequential...

By a player splitting we mean a mechanism that distributes the information sets of a player among so-called agents. A player splitting is called independent if each path in the game tree contains at most one agent of every player. Following Mertens (1989), a solution is said to have the player...