We study games played between groups of players, where a given group decides which strategy it will play through a vote by its members. When groups consist of two voting players, our games can also be interpreted as network-formation games. In experiments on Stag Hunt games, we find a stark...

This paper examines how neutral the current EU decision-making procedures are to membership and how well they obey certain transparent general constitutional principles. The paper evaluates the performance of the procedures by strategic and classical power indices. The main emphasis in the...

Considerable experimental evidence has been collected on how to solve the public-good dilemma. In a 'first generation' of experiments, this was done by presenting subjects with a pre-specified game out of a huge variety of rules. A 'second generation' of experiments introduced subjects to two...

Herein, we prove a Condorcet jury theorem (CJT) for large elections with multiple alternatives. Voters have common interests that depend on an unknown state of nature. Each voter receives an imprecise private signal about the state of nature and then submits one vote (simple plurality rule). We...

We design the class of (indirect) Approval mechanisms which allow the players' strategies to coincide with the subsets of the outcome space. By focusing on the single-peaked domain, we prove that: a) Each of these mechanisms is characterized by a unique equilibrium outcome, and b) for almost...

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...

This paper experimentally analyzes the effects if signatories to an international environmental agreement (IEA) apply different voting schemes to determine the terms of the agreement. To this end, unanimity, qualified majority voting, and simple majority voting are compared with respect to the...

This paper studies the application of the notion of secure implementation (Cason, Saijo, Sjöström, and Yamato, 2006; Saijo, Sjöström, and Yamato, 2007) to the problem of allocating indivisible objects with monetary transfers. We propose a new domain-richness condition, termed as minimal...

Following Barberà, Sonnenschein, and Zhou (1991, Econometrica 59, 595-609), we study rules (or social choice functions) through which agents select a subset from a set of objects. We investigate domains on which there exist nontrivial strategy-proof rules. We establish that the set of separable...

We consider the problem of allocating infinitely divisible commodities among a group of agents. Especially, we focus on the case where there are several commodities to be allocated, and agents have continuous, strictly convex, and separable preferences. In this paper, we establish that the...