2 citations · 8 across the 10 of their papers we have counts for
10 papers
Improved lower bounds for the maximum size of Condorcet domains
Alexander Karpov, Klas Markstrom, Soren Riis +1
Condorcet domains are sets of linear orders with the property that, whenever voters' preferences are restricted to the domain, the pairwise majority relation (for an odd number of…
An orderly algorithm for generation of Condorcet Domains
Bei Zhou, Klas Markström
Condorcet domains are fundamental objects in the theory of majority voting; they are sets of linear orders with the property that if every voter picks a linear order from this set,…
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…
CDL: A fast and flexible library for the study of permutation sets with structural restrictions
Bei Zhou, Klas Markstrōm, Søren Riis
In this paper, we introduce CDL, a software library designed for the analysis of permutations and linear orders subject to various structural restrictions. Prominent examples of th…
Bipartite peak-pit domains
Alexander Karpov, Klas Markström, Søren Riis +1
In this paper, we introduce the class of bipartite peak-pit domains. This is a class of Condorcet domains which include both the classical single-peaked and single-dipped domains.…
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…
A Hybrid Natural Language Generation System Integrating Rules and Deep Learning Algorithms
Wei Wei, Bei Zhou, Georgios Leontidis
This paper proposes an enhanced natural language generation system combining the merits of both rule-based approaches and modern deep learning algorithms, boosting its performance…