16 citations · 30 across the 12 of their papers we have counts for
13 papers
Condorcet Domains of Degree at most Seven
Dolica Akello-Egwell, Charles Leedham-Green, Alastair Litterick +2
In this paper we give the first explicit enumeration of all maximal Condorcet domains on alternatives. This has been accomplished by developing a new algorithm for constr…
The Largest Condorcet Domains on 8 Alternatives
Charles Leedham-Green, Klas Markström, Søren Riis
In this note, we report on a record-breaking Condorcet domain (CD) for n=8 alternatives. We show that there exists a CD of size 224, which is optimal and essentially unique (up to…
A heuristic search algorithm for discovering large Condorcet domains
Bei Zhou, Søren Riis
The study of large Condorcet domains (CD) has been a significant area of interest in voting theory. In this paper, our goal is to search for large CDs that are hitherto unknown. Wi…
Impartial Games: A Challenge for Reinforcement Learning
Bei Zhou, Søren Riis
AlphaZero-style reinforcement learning (RL) algorithms have achieved superhuman performance in many complex board games such as Chess, Shogi, and Go. However, we showcase that thes…
Network Communication with operators in Dedekind Finite and Stably Finite Rings
Søren Riis
Messages in communication networks often are considered as "discrete" taking values in some finite alphabet (e.g. a finite field). However, if we want to consider for example commu…
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…