Zobrazeno 1 - 10
of 1 497
pro vyhledávání: '"Markström, A."'
We computationally completely enumerate a number of types of row-column designs up to isotopism, including double, sesqui and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO-arrays. We calcul
Externí odkaz:
http://arxiv.org/abs/2406.16444
More, better or different? Trade-offs between group size and competence development in jury theorems
Autor:
Arrhenius, Gustaf, Markström, Klas
In many circumstances there is a trade off between the number of voters and the time they can be given before having to make a decision since both aspects are costly. An example is the hiring of a committee with a fixed salary budget: more people but
Externí odkaz:
http://arxiv.org/abs/2404.09523
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 independence of irrelevant alternatives. First we report on a computational gener
Externí odkaz:
http://arxiv.org/abs/2401.12547
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 some kind of restriction, such as being single-peaked on a political a
Externí odkaz:
http://arxiv.org/abs/2401.11912
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. Our class of domains can be used to model situations where some altern
Externí odkaz:
http://arxiv.org/abs/2308.02817
Autor:
Akello-Egwell, Dolica, Leedham-Green, Charles, Litterick, Alastair, Markström, Klas, Riis, Søren
In this paper we give the first explicit enumeration of all maximal Condorcet domains on $n\leq 7$ alternatives. This has been accomplished by developing a new algorithm for constructing Condorcet domains, and an implementation of that algorithm whic
Externí odkaz:
http://arxiv.org/abs/2306.15993
Let $\mathbf{G}:=(G_1, G_2, G_3)$ be a triple of graphs on a common vertex set $V$ of size $n$. A rainbow triangle in $\mathbf{G}$ is a triple of edges $(e_1, e_2, e_3)$ with $e_i\in G_i$ for each $i$ and $\{e_1, e_2, e_3\}$ forming a triangle in $V$
Externí odkaz:
http://arxiv.org/abs/2305.12772
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 isomorphism). If we consider the underlying permutations and focus on
Externí odkaz:
http://arxiv.org/abs/2303.15002
Let $\mathbf{G}:=(G_1, G_2, G_3)$ be a triple of graphs on the same vertex set $V$ of size $n$. A rainbow triangle in $\mathbf{G}$ is a triple of edges $(e_1, e_2, e_3)$ with $e_i\in G_i$ for each $i$ and $\{e_1, e_2, e_3\}$ forming a triangle in $V$
Externí odkaz:
http://arxiv.org/abs/2212.07180
Publikováno v:
Journal of Children's Services, 2023, Vol. 19, Issue 1, pp. 20-37.
Externí odkaz:
http://www.emeraldinsight.com/doi/10.1108/JCS-06-2023-0035