In ordinal (probabilistic) assignment problems, each agent reports his preference rankings over objects and receives a lottery defined over those objects. A common efficiency notion, sd-efficiency, is obtained by extending the preference rankings to preferences over lotteries by means of...

We consider house (re)allocation problems (Shapley and Scarf, 1974) with strict preferences. We are concerned with the possibility that a pair of agents may gain by swapping their endowments before the operation of the chosen rule. A rule is called endowments-swapping-proof if it is immune to...

We study the possibility of designing satisfactory ex post incentive compatible single valued direct mechanisms in interdependent values environments, characterized by the set of agents type profiles and by their induced preference profiles. For environments that we call knit and strict, only...

We consider a model in which projects are to be assigned to agents based on their preferences, and where projects have capacities, i.e., can each be assigned to a minimum and maximum number of agents. The extreme cases of our model are the social choice model (the same project is assigned to all...

We perform a laboratory test of Pledge-and-Review bargaining, implementing a simplified version of the model analysed in Harstad (2019). In theory, this institution should increase contributions to a public good only if there is uncertainty over the value of possible future payoffs. In contrast,...

Are there collective decision methods which (i) give everyone, including minorities, an equal share of effective power even if voters act strategically, (ii) promote consensus and equality, rather than polarization and inequality, and (iii) do not favour the status quo or rely too much on...

The paper starts from the hypothesis that the public good index (PGI) could be much more successful if it were introduced by a more prominent game theorist. It argues that the violation of local monotonicity, inherent to this measure of a priori voting power, can be an asset – especially if...

We study the indivisible object allocation problem without monetary transfer, in which each object is endowed with a weak priority ordering over agents. It is well known that stability is generally not compatible with efficiency in this problem. We characterize the priority structures for which...

We observe that three salient solutions to matching, division and house allocation problems are not only (partially) strategy-proof, but (partially) group strategy-proof as well, in appropriate domains of definition. That is the case for the Gale-Shapley mechanism, the uniform rule and the top...

We introduce a new matching model to mimic two-sided exchange programs such as tuition and worker exchange, in which each firm has to avoid being a net-exporter of workers. These exchanges use decentralized markets, making it difficult to achieve a balance between exports and imports. We show...