A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
The design of voting rules is traditionally guided by desirable axioms. Recent work shows that, surprisingly, the axiomatic approach can also support the generation of explanations for voting outcomes. However, no bounds on the size of these explanations is given; for all we know, they may be unbearably tedious. We prove, however, that outcomes of the important Borda rule can be explained using O(m 2 ) steps, where m is the number of alternatives. Our main technical result is a general lowerdblp:conf/nips/PetersPPZ20 fatcat:cd42dfdoi5fexosus6h6dfj5ke