z-logo
Premium
Trading Votes for Votes. A Dynamic Theory
Author(s) -
Casella Alessandra,
Palfrey Thomas
Publication year - 2019
Publication title -
econometrica
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 16.7
H-Index - 199
eISSN - 1468-0262
pISSN - 0012-9682
DOI - 10.3982/ecta15940
Subject(s) - condorcet method , outcome (game theory) , mathematical economics , separable space , economics , pareto principle , preference , voting , convergence (economics) , finite set , microeconomics , mathematics , mathematical optimization , politics , political science , mathematical analysis , law , economic growth
We develop a framework to study the dynamics of vote trading over multiple binary issues. We prove that there always exists a stable allocation of votes that is reachable in a finite number of trades, for any number of voters and issues, any separable preference profile, and any restrictions on the coalitions that may form. If at every step all blocking trades are chosen with positive probability, convergence to a stable allocation occurs in finite time with probability 1. If coalitions are unrestricted, the outcome of vote trading must be Pareto optimal, but unless there are three voters or two issues, it need not correspond to the Condorcet winner.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here