Efficient Dodgson-Score Calculation Using Heuristics and Parallel Computing
원문 초록
Conflict of interest is the permanent companion of any population of agents (computational or biological). For that reason, the ability to compromise is of paramount importance, making voting a key element of societal mechanisms. One of the voting procedures most often discussed in the literature and, due to its intuitiveness, also conceptually quite appealing is Charles Dodgson's scoring rule, basically using the respective closeness to being a Condorcet winner for evaluating competing alternatives. In this paper, we offer insights on the practical limits of algorithms computing the exact Dodgson scores from a number of votes. While the problem itself is theoretically intractable, this work proposes and analyses five different solutions which try distinct approaches to practically solve the issue in an effective manner. Additionally, three of the discussed procedures can be run in parallel which has the potential of drastically reducing the problem size.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
h-calibration: Rethinking Classifier Recalibration with Probabilistic Error-Bounded Objective
Enforcing tail calibration when training probabilistic forecast models
Harnessing Superclasses for Learning from Hierarchical Databases
Bayesian Autoregressive Online Change-Point Detection with Time-Varying Parameters
Improving probabilistic forecasts of extreme wind speeds by training statistical post-processing models with weighted scoring rules
Distributional Regression U-Nets for the Postprocessing of Precipitation Ensemble Forecasts
토론
이 논문과 연결된 포럼 글이 아직 없습니다.