Tournaments are complete and asymmetric binary relations. This type of binary relation rules out the possibility of ties or indifferences which are quite common in other contexts. In this work we generalize, from a normative point of view, some important tournament solutions to the context in...

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 an experiment to test how voters vote in a small committee election with three alternatives. Voters have common preferences that depend on an unknown state of nature. Each voter receives an imprecise private signal prior to the election and then casts a vote. The alternative with the...

We investigate whether the simple plurality rule aggregates information efficiently in a large election with three alternatives. The environment is the same as in the Condorcet Jury Theorem (Condorcet (1785)). Voters have common preferences that depend on the unknown state of nature, and they...