Constructing large peak-pit Condorcet domains
Dados Bibliográficos
| ID | 21405033 |
|---|---|
| Autores | Alexander Karpov (0000-0002-2693-2389, National Research University Higher School of Economics), Arkadii Slinko (0000-0002-0397-6290, University of Auckland, autor correspondente) |
| Ano | 2023 |
| Volume | 94 |
| Fascículo | 1 |
| Páginas | 97-120 |
| Data de publicação | 2023-01-01 |
| Open Access | Sim |
| Tipo | ARTICLE |
| Periódico | Theory and Decision (JOURNAL) |
| Identificadores do periódico | ISSN: 0040-5833 • E-ISSN: 1573-7187 |
| Editora | Springer Science and Business Media LLC (PUBLISHER) |
| DOI | 10.1007/s11238-022-09878-9 |
| OpenAlex | W4213420039 |
| Idioma | EN |
| Citações recebidas | 3 |
| Referências citadas | 22 |
We present a new method of constructing Condorcet domains from pairs of Condorcet domains of smaller sizes (concatenation + shuffle scheme). The concatenation + shuffle scheme provides maximal, connected, copious, peak-pit domains whenever the original domains have these properties. It allows to construct maximal peak-pit Condorcet domains that are larger than those obtained by the Fishburn’s alternating scheme for all $$n\ge 13$$ n ≥ 13 alternatives. For a large number n of alternatives, we get a lower bound $$2.1045^{n}$$ 2 . 1045 n for the cardinality of the largest peak-pit Condorcet domain and a lower bound $$2.1890^{n}$$ 2 . 1890 n for the cardinality of the largest Condorcet domain, improving Fishburn’s result. We also show that all Arrow’s single-peaked domains can be constructed by concatenation + shuffle scheme starting from the trivial domain
Algorithm · Cardinality (data modeling) · Combinatorics · Concatenation (mathematics) · Database · Domain (mathematical analysis) · Mathematical analysis · Complexity and Algorithms in Graphs · Computer Science · Machine Learning and Algorithms · Mathematics · Numerical Methods and Algorithms
| Citações por ano | 1 |
|---|---|
| Intervalo de citações | 2023 - 2024 (2) |
| Altamente citado | Não |