This paper presents an evaluation protocol that transforms a collection of rankings, defined over set alternatives, into complete, transitive, and cardinal assessment. It combines the ideas Borda Condorcet by computing support each alternative receives on average when confronted with any other. The evaluates those alternatives in terms pairwise comparisons but weighs outcomes differently depend...

In collective decision making, where a voting rule is used to take a collective decision among a group of agents, manipulation by one or more agents is usually considered negative behavior to be avoided, or at least to be made computationally difficult for the agents to perform. However, there are scenarios in which a restricted form of manipulation can instead be beneficial. In this paper we c...

László Borda, Gergely Zaránd, and D. Goldhaber-Gordon 1 Department of Theoretical Physics and Research Group “Theory of Condensed Matter” of the Hungarian Academy of Sciences,Budapest University of Technology and Economics,Budafoki út 8. H-1521 Hungary 2 Institut für Theoretische Festkörperphysik,Universität Karlsruhe,76128 Karlsruhe, Germany 3 Physics Department and Geballe Laboratory for Adva...

Scoring rules are a broad and concisely-representable class of voting rules which includes, for example, Plurality and Borda. Our main result asserts that the class of scoring rules, as functions from preferences into candidates, is efficiently learnable in the PAC model. We discuss the applications of this result to automated design of scoring rules. We also investigate possible extensions of ...

In thiswork,we contribute to the formal and computational analysis of themeasurement of consensus in a society.We propose a unifyingmodel that generates a consistent decision in terms of the individual preferences and thenmeasures the consensus that arises from it.We focus our inspection on two relevant and specific cases: the Borda and the Copeland rules under a Kemeny-type measure. A computat...