Statistical estimation using pairwise comparison data is an effective approach to analyzing large-scale sparse networks. In this article, we propose a general framework model the mutual interactions in network, which enjoys ample flexibility terms of parameterization. Under setup, show that maximum likelihood estimator for latent score vector subjects uniformly consistent under near-minimal con...

A tournament is a binary dominance relation on a set of alternatives. Tournaments arise in many contexts that are relevant to AI, most notably in voting (as a method to aggregate the preferences of agents). There are many works that deal with choice rules that select a desirable alternative from a tournament, but very few of them deal directly with incentive issues, despite the fact that gameth...

Accurate prediction of foreign tourist numbers is crucial for each country to devise sustainable tourism development policies. Tourism time series data often have significant temporal fluctuation, so Grey–Markov models based on a grey model with a first order differential equation and one variable, GM(1,1), can be appropriate. To further improve prediction accuracy from Grey–Markov models, this...

Sequence comparison is one of the most fundamental computational problems in bioinformatics. Pairwise sequence alignment methods align two sequences using a substitution matrix consisting of pairwise scores of aligning different residues with each other (like BLOSUM62), and give an alignment score for the given sequence-pair. This work 1 addresses the problem of accurately estimating statistica...

In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group G, non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided. Basic criteria for finding a nearest consistent pairwise comparisons matrix (extended to the class of group G) are proposed. A geometric interpretation of pairwis...

We consider lower bounding the maximum achievable rate of a differential unitary spacetime transmission subject to a prescribed performance. We characterize the performance using a suitably defined distance between two unitary matrices, which was previously obtained through pairwise error probability analysis. Considering the set of all unitary or orthogonal matrices as a compact manifold with ...

We present a family of adaptive pairwise tournaments which are provably robust against large error fractions when used to determine the largest element in a set. These tournaments use nk pairwise comparisons but have only O(k + log n) depth where n is the number of players and k is a robustness parameter (for reasonable values of n and k). We show how these tournaments can be used to prove mult...

Users make choices among multi-attribute objects in a data set in a variety of domains including used car purchase, job search and hotel room booking. Individual users sometimes have strong preferences between objects, but these preferences may not be universally shared by all users. If we can cast these preferences as derived from a quantitative user-specific preference function, then we can p...

Our research focused on testing various characteristics of pairwise comparison (PC) matrices in controlled experiments. About 270 students have been involved in the test exercises and the final pool contained 450 matrices. Our team conducted experiments with matrices of different size obtained from different types of MADM problems. The matrix elements have been generated by different questionin...