Abstract. In this paper, we develop methods for constructing votebuying/coercion attacks on end-to-end voting systems, and describe votebuying/coercion attacks on three proposed en...
John Kelsey, Andrew Regenscheid, Tal Moran, David ...
We study computational problems that arise in the context of iterated dominance in anonymous games, and show that deciding whether a game can be solved by means of iterated weak d...
We consider the problem of finding semi-matching in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster algorithms ...
We study a resource allocation problem where jobs have the following characteristics: Each job consumes some quantity of a bounded resource during a certain time interval and indu...
This paper addresses the issue of supporting the end-user of a classifier, when it is used as a decision support system, to classify new cases. We consider several kinds of classif...