Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
153 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Structured Voting for Structured Committees (2211.06379v1)

Published 9 Nov 2022 in cs.GT and math.RT

Abstract: There has been much recent work on multiwinner voting systems. However, sometimes a committee is highly structured, and if we want to vote for such a committee, our voting method should be more structured as well. We consider committees consisting of representatives for disjoint parts of a collective; for instance, n departments of an organization might each have m possible representatives to choose from. However, in our model the entire population still gets to vote on the committee, and we need to respect that symmetry, which we do by building on earlier work of Barcelo et al. using representation theory of wreath products. The main thrust of this paper is to advertise and catalog the surprising variety of possible points-based (linear) voting methods in this framework. For instance, if a voter ranks all possible structured committees, it may be reasonable to use weights which depend on the relations between the ranked committees, and not just their order as in 'traditional' voting frameworks!

Summary

We haven't generated a summary for this paper yet.