Three fundamental axioms in social choice theory are consistency with respect to a variable electorate, consistency with respect to a variable agenda, and consistency with respect to composed preference profiles. In the context of traditional non-probabilistic social choice, these axioms are known to be highly incompatible. We show that in the context of probabilistic social choice, the axioms uniquely characterize a function proposed by Fishburn (Rev. Econ. Stud., 51(4), 683–692, 1984). The function returns so-called maximal lotteries, i.e., lotteries that correspond to optimal mixed strategies of the underlying plurality game. Maximal lotteries are guaranteed to exist due to von Neumann’s Minimax Theorem and are almost always unique. 1
We study social decision schemes (SDSs), i.e., functions that map a collection of individual prefere...
We investigate implementation of social choice functions that map states to lotteries, where agents ...
Efficiency—no agent can be made better off without mak-ing another one worse off—and strategyproofne...
We consider social choice rules which select a lottery over outcomes for each progile of individual ...
We consider social choice rules which select a lottery over outcomes for each profile of individual ...
We consider social choice rules which select a lottery over outcomes for each profile of individual ...
Two fundamental notions in microeconomic theory are ef-ficiency—no agent can be made better off with...
We investigate implementation of social choice functions as mappings from states to lotteries under ...
Efficiency--no agent can be made better off without making another one worse off--and strategyproofn...
An anonymous social choice function for a large atomless population maps cross-section distributions...
We investigate implementation of social choice functions as mappings from states to lotteries under ...
We unify and extend much of the literature on probabilistic voting in two-candidate elec-tions. We g...
We take a decision theoretic approach to the classic social choice problem, using data on the freque...
Voting problems with a continuum of voters and finitely many alternatives are considered. The classi...
This thesis consists of two separate papers in strategy-proof social choice theory. The first paper,...
We study social decision schemes (SDSs), i.e., functions that map a collection of individual prefere...
We investigate implementation of social choice functions that map states to lotteries, where agents ...
Efficiency—no agent can be made better off without mak-ing another one worse off—and strategyproofne...
We consider social choice rules which select a lottery over outcomes for each progile of individual ...
We consider social choice rules which select a lottery over outcomes for each profile of individual ...
We consider social choice rules which select a lottery over outcomes for each profile of individual ...
Two fundamental notions in microeconomic theory are ef-ficiency—no agent can be made better off with...
We investigate implementation of social choice functions as mappings from states to lotteries under ...
Efficiency--no agent can be made better off without making another one worse off--and strategyproofn...
An anonymous social choice function for a large atomless population maps cross-section distributions...
We investigate implementation of social choice functions as mappings from states to lotteries under ...
We unify and extend much of the literature on probabilistic voting in two-candidate elec-tions. We g...
We take a decision theoretic approach to the classic social choice problem, using data on the freque...
Voting problems with a continuum of voters and finitely many alternatives are considered. The classi...
This thesis consists of two separate papers in strategy-proof social choice theory. The first paper,...
We study social decision schemes (SDSs), i.e., functions that map a collection of individual prefere...
We investigate implementation of social choice functions that map states to lotteries, where agents ...
Efficiency—no agent can be made better off without mak-ing another one worse off—and strategyproofne...