改进的Condorcet域最大规模下界
Improved lower bounds for the maximum size of Condorcet domains
AI总结:
本文通过新的归纳搜索方法改进了Condorcet域的最大规模下界,并给出了新的渐近下界。
摘要:
Condorcet域是具有性质的线性顺序集,即当选民的偏好被限制在该域内时, pairwise多数关系(对于奇数个选民)是传递的,因此是一个线性顺序。确定Condorcet域的最大规模,有时在附加约束下,一直是多数投票数学理论中的长期问题。精确的最大规模仅在n≤8个替代方案时已知。在本文中,我们利用对小n的最大数据域的结构分析,设计了一种新的归纳搜索方法。通过在超级计算机上实现该方法,结合现有算法,我们提高了所有9≤n≤20的已知最大规模域的规模。这些域随后用于单独的构造,以获得目前已知的21≤n≤25的最大规模域,并将最大规模Condorcet域的渐近下界提高到Ω(2.198139^n)。最后,我们讨论了发现的域的性质,并陈述了几个开放问题和猜想。
英文摘要:
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 voters) is transitive and hence a linear order. Determining the maximum size of a Condorcet domain, sometimes under additional constraints, has been a longstanding problem in the mathematical theory of majority voting. The exact maximum is only known for $n\leq 8$ alternatives. In this paper we use a structural analysis of the largest domains for small $n$ to design a new inductive search method. Using an implementation of this method on a supercomputer, together with existing algorithms, we improve the size of the largest known domains for all $9 \leq n \leq 20$. These domains are then used in a separate construction to obtain the currently largest known domains for $21 \leq n \leq 25$, and to improve the best asymptotic lower bound for the maximum size of a Condorcet domain to $Ω(2.198139^n)$. Finally, we discuss properties of the domains found and state several open problems and conjectures.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。