Agents are farsighted when they consider the ultimate results to which their own actions may lead to. We re-examine the classical questions of implementation theory under complete information in a setting with transfers where farsighted coalitions are regarded as fundamental behavioral units and...

We revisit the problem of providing a pure public good in economies involving two agents, under the assumption that preferences are quasilinear. We characterize the class of strategy-proof, anonymous and feasible mechanisms that are not dominated by another strategy-proof, anonymous and feasible...

A group of individuals meet to share the cost and determine output allocations of a partial-excludable public good. We demonstrate that, for general cost functions and preferences that satisfy the Spence-Mirlees sorting condition, the serial cost-sharing formula (Moulin, 1994) has remarkable...

The paper considers a voting model where each voter's type is her preference. The type graph for a voter is a graph whose vertices are the possible types of the voter. Two vertices are connected by an edge in the graph if the associated types are "neighbors." A social choice function is locally...

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

Experiments evaluate the fit of human behaviour to the Shapley-Shubik power index (SSPI), a formula of voter power. Groups of six subjects with differing votes divide a fixed purse by majority rule in online chat rooms. Earnings proxy for measured power. Chat rooms and processes for selecting...

Approval voting allows voters to list any number of candidates. Their scores are obtained by summing the votes cast in their favor. Fractional voting instead follows the One-person-one-vote principle by endowing voters with a single vote that they may freely distribute among candidates. In this...

We examine the Talmudic three wives problem, which is a generalization of the Talmudic contested garment problem solved by Aumann and Maschler (1985) using coalitional procedure. This problem has many practical applications. In an attempt to unify all Talmudic methods, Guiasu (2010, 2011)...

The Shapley-Shubik index was designed to evaluate the power distribution in committee systems drawing binary decisions and is one of the most established power indices. It was generalized to decisions with more than two levels of approval in the input and output. In the limit we have a continuum...

In general, analyses of voting power are performed through the notion of a simple voting game (SVG) in which every voter can choose between two options: 'yes' or 'no'. Felsenthal and Machover (1997) introduced the concept of ternary voting games (TVGs) which recognizes abstention alongside. They...