Representation Theory of the Symmetric Group in Voting Theory and Game Theory

Abstract

This paper is a survey of some of the ways in which the representation theory of the symmetric group has been used in voting theory and game theory. In particular, we use permutation representations that arise from the action of the symmetric group on tabloids to describe, for example, a surprising relationship between the Borda count and Kemeny rule in voting. We also explain a powerful representation-theoretic approach to working with linear symmetric solution concepts in cooperative game theory. Along the way, we discuss new research questions that arise within and because of the representation-theoretic framework we are using.

20 pages

References in corpus (1)

• A Maximum Likelihood Approach For Selecting Sets of Alternatives

Cited by in corpus (4)

• Decomposed Structured Subsets for Semidefinite and Sum-of-Squares Optimization
• Multistage Distributionally Robust Mixed-Integer Programming with Decision-Dependent Moment-Based Ambiguity Sets
• Combinatorial and algebraic perspectives on the marginal independence structure of Bayesian networks
• Voting on Cyclic Orders, Group Theory, and Ballots