4 citations · 8 across the 5 of their papers we have counts for
5 papers
Arrow's single peaked domains, richness, and domains for plurality and the Borda count
Klas Markström, Søren Riis, Bei Zhou
In this paper we extend the study of Arrow's generalisation of Black's single-peaked domain and connect this to domains where voting rules satisfy different versions of independenc…
Local Diversity of Condorcet Domains
Alexander Karpov, Klas Markström, Søren Riis +1
Several of the classical results in social choice theory demonstrate that in order for many voting systems to be well-behaved the set domain of individual preferences must satisfy…
Exploring Parity Challenges in Reinforcement Learning through Curriculum Learning with Noisy Labels
Bei Zhou, Soren Riis
This paper delves into applying reinforcement learning (RL) in strategy games, particularly those characterized by parity challenges, as seen in specific positions of Go and Chess…
Graph Guessing Games and non-Shannon Information Inequalities
Rahil Baber, Demetres Christofides, Anh N. Dang +2
Guessing games for directed graphs were introduced by Riis for studying multiple unicast network coding problems. In a guessing game, the players toss generalised dice and can see…
Fixed points of Boolean networks, guessing graphs, and coding theory
Maximilien Gadouleau, Adrien Richard, Søren Riis
In this paper, we are interested in the number of fixed points of functions over a finite alphabet defined on a given signed digraph . We first use techniques…