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 authors examine a bargaining setting where heterogeneous buyers and sellers are repeatedly matched and time is costly. They characterize efficiency and then, using an implementation approach, study the allocations that can result in equilibrium when the matched buyers and sellers bargain...