In computational social choice, one important problem is to take the votes of a subelectorate (subset of the voters), and summarize them using a small number of bits. This needs t...
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
In many settings, a group of agents must come to a joint decision on multiple issues. In practice, this is often done by voting on the issues in sequence. In this paper, we model ...
We consider a distributed system where each node keeps a local count for items (similar to elections where nodes are ballot boxes and items are candidates). A top-k query in such ...
Complex distributed systems are increasingly important in modern computer science, yet many undergraduate curricula do not give students the opportunity to develop the skill sets ...
Joel Wein, Kirill Kourtchikov, Yan Cheng, Ron Guti...