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...

In this paper, we introduce and explore γ-S-closed spaces. It is evident by definition that γ-S-closed space coincides with γ-s-closed space, if the underlying space is γ-extremally-disconnected. AMS (MOS) Subject Classification Codes: 54A05, 54A10, 54D10, 54D99.

due to the lack of specified linage and parentage information from exotic broodstocks of litopenaeus vannamei shrimp, in iran and multiple breeding of closed broodstock populations, also concern about the low level of genetic diversity and accumulated inbreeding and in order to comparison of the genetic variability indices and analysis of the genetic differentiation, total of 30 samples from bo...

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...

This paper revisits the pairwise sorting network introduced by Parberry in the early 90’s. We provide a simple specification of the pairwise network which also clarifies its close resemblance to the more classic odd-even network introduced by Batcher in the mid 60’s. Finally we illustrate that pairwise networks are better suited than odd-even networks for the construction of selection networks.