Ranking participants in generalized tournaments
نویسندگان
چکیده
Consider the problem of ranking social alternatives based on the number of voters that prefer one alternative to the other. Or consider the problem of ranking chess players by their past performance. A wide variety of ranking methods have been proposed to deal with these problems. Using six independent axioms, we characterize the fair-bets ranking method proposed by Daniels [4] and Moon and Pullman [14].
منابع مشابه
A paired comparisons ranking and Swiss-system chess team tournaments
The paper reveals that the Weighted Logarithmic Least Squares Method used for deriving evaluations of alternatives from incomplete pairwise comparison matrices (iWLLSM) coincides with the recursive Buchholz ranking method applied in generalized tournaments, despite their different approach and calculation. We study it with respect to a set of new properties and present the strength of the metho...
متن کاملOn the additivity of preference aggregation methods
The paper reviews some axioms of additivity concerning ranking methods used for generalized tournaments with possible missing values and multiple comparisons. It is shown that one of the most natural properties, called consistency, has strong links to independence of irrelevant comparisons, an axiom judged unfavourable when players have different opponents. Therefore some directions of weakenin...
متن کاملApproximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems
We design the first polynomial time approximation schemes (PTASs) for the Minimum Betweenness problem in tournaments and some related higher arity ranking problems. This settles the approximation status of the Betweenness problem in tournaments along with other ranking problems which were open for some time now. The results depend on a new technique of dealing with fragile ranking constraints a...
متن کاملProperties of K-tournaments
In this thesis, we investigate several properties of k-tournaments, where k 2 3. These properties fall into three broad areas. The first contains properties related to the ranking of the participants in a k-tournament, including a representation theorem for posets. The second contains properties related to the representation of a finite group as the automorphism group of a k-tournament, with va...
متن کاملX Collusion-Resistant Tournament Design to Create and Disseminate Knowledge in Formal Sciences
We solve the problem of collusion in massive online tournaments (of formal scientific communities) which, surprisingly, has a simple yet rather counterintuitive solution. The solution requires that we collect the participants’ side-choices of whether they want to be proponent or opponent of a given claim, leading to the concept of a forced player or a devil’s advocate. In the presence of side-c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Game Theory
دوره 33 شماره
صفحات -
تاریخ انتشار 2005