Analysis of preferential experiments

  title={Analysis of preferential experiments},
  author={C. Ramanujacharyulu},
The problems of selecting the winner in a tournament, a leader in a society, or the most dominating or influential person in a group of individuals are not infrequent. Graph theory is successfully used in such situations in locating, by the use of associated matrices of graphs representing the individuals under the studied relation, the person with the greatest power to influence. In this paper one more important point is brought into consideration before selecting the leader or the most… Expand
A Method of Evaluating Contestants
Various iterative methods based on paired comparisons have been advocated for ranking contestants. H. A. David [1] has discussed many of these methods. Perhaps the best known methods involveExpand
Ranking in Tournaments and Group Decisionmaking
This paper fully discusses methods for ranking a set of alternatives in the fairest possible way according to a minimum violations criterion. New methods, based on finding paths and circuits inExpand
Properties of Tournaments Among Well-Matched Players
A matrix A whose entries are zeros and ones is a tournament matrix exactly when, and the properties of A are related to the strengths of the players are the focus of this paper. Expand
Dominance relations and ranking when quantity and quality both matter: Applications to US universities and econ. departments worldwide
In this article, we propose to extend the concept of stochastic dominance, extensively used in decision theory and social choice, to the comparison of composite outcomes, both the quality andExpand
On Generalized Tournament Matrices
played (i.e., there are no ties). The outcome of the tournament may be represented by an n x n tournament matrix T where lij = 1 if player i defeats player j (symbolically, i -+ j) and zeroExpand
The complexity of interdependent structural systems greatly complicates the analysis of any single structure. This is particularly the case when a structure represents some behavioral process. ForExpand
An eigenvalue method for evaluating contestants
  • E. Hannan
  • Mathematics, Computer Science
  • Comput. Oper. Res.
  • 1983
Abstract The article demonstrates the applicability of Saaty's Analytical Hierarchy Process to the contestant ranking problem, which involves the ranking or seeding of contestants, each of whom has aExpand
Chapter 17 Paired comparisons
  • L. B. Anderson
  • Mathematics, Computer Science
  • Operations research and the public sector
  • 1994
The chapter describes the deterministic combinatorial methods and the methods based on probability models and the Kendall–Wei method for determining rankings based on paired comparisons. Expand
A note on perron vectors for almost regular tournament matrices
Abstract Let T be an almost regular tournament matrix of order n with right perron vector w . We show that if the i th row sum of T is (n − 2) 2 and the j th row sum is n 2 , then w i w j . Thus inExpand
Spectral radii of tournament matrices whose graphs are related by an arc reversal
Abstract Given an irreducible tournament matrix t and a pair of distinct indices i and j , let T ( i , j ) be the matrix obtained from T by transposing its principal submatrix on rows and columns iExpand