We study the possibilities for agenda manipulation under strategic voting for two prominent sequential voting procedures: the amendment procedure and the suc- cessive procedure. We show that a well known result for tournaments, namely that the successive procedure is (weakly) more manipulable...

We study the possibilities for agenda manipulation under strategic voting for two prominent sequential voting procedures, the amendment and the successive procedure. We show that a well-known result for tournaments, namely that the successive procedure is (weakly) more manipulable than the...

This paper revisits manipulation via capacities in centralized two-sided matching markets. Sönmez (1997) showed that no stable mechanism is nonmanipulable via capacities. We show that non-manipulability via capacities can be equivalently described by two types of non-manipulation via...

This paper revisits manipulation via capacities in centralized two-sided matching markets. Sönmez (1997) showed that no stable mechanism is nonmanipulable via capacities. We show that non-manipulability via capacities can be equivalently described by two types of non-manipulation via...

A common real-life problem is to fairly allocate a number of indivisible objects and a fixed amount of money among a group of agents. Fairness requires that each agent weakly prefers his consumption bundle to any other agent's bundle. In this context, fairness is incompatible with budget-balance...