The implementation problem is the problem of designing a mechanism (game form) such that the equilibrium outcomes satisfy a criterion of social optimality embodied in a social choice rule. If a mechanism has the property that, in each possible state of the world, the set of equilibrium outcomes...

We introduce a description of the power structure which is inherent in a strategic game form using the concept of an interaction sheaf. The latter assigns to each open set of outcomes a set of interaction arrays, specifying the changes that coalitions can make if outcome belongs to this open...

In this paper we deal with situations of collective contests between two groups over a private prize. A well known way to divide the prize within the winning group is the prize sharing rule introduced by Nitzan, 1991. Since its introduction it has become a standard in the collective contests...

We develop a model of strategic information transmission from an expert with informational superiority to decision makers who vote on a proposal. We show that an expert's simple cheap talk strategy can be surprisingly effective in persuading decision makers by polarizing or unifying their...

In this paper we provide sufficient conditions for a social choice rule to be implementable in strong Nash equilibrium in the presence of partially honest agents, that is, agents who break ties in favor of a truthful message when they face indifference between outcomes. In this way, we achieve a...

Weighted committee games generalize n-player simple voting games to m ≥ 3 alternatives. The committee's aggregation rule treats votes anonymously but parties, shareholders, members of supranational organizations, etc. differ in their numbers of votes. Infinitely many vote distributions induce...

This paper analyses data collected in 2012 and 2013 at the ESSEC Business School from Kallystée, a proprietary mass-attendance business game. Company boards are simulated by teams of five students selected at random. The design manipulates the gender composition of the boards to allow for all...

In several situations agents need to be assigned to activities on basis of their preferences, and each agent can take part in at most one activity. Often, the preferences of the agents do not depend only on the activity itself but also on the number of participants in the respective activity. In...

This paper studies coalitional strategy-proofness of social choice correspondences that map preference profiles into sets of alternatives. In particular, we focus on the Pareto rule, which associates the set of Pareto optimal alternatives with each preference profile, and examine whether or not...