In this paper, we advocate the use of setwise contests for aggregating a set input rankings into an output ranking. We propose generalization Kemeny rule where one minimizes number k-wise disagreements instead pairwise (one counts 1 disagreement each time top choice in subset alternatives cardinality at most k differs between ranking and ranking). After algorithmic study aggregation problem, in...

This study examines the notion of inconsistency in pairwise comparisons for providing an axiomatization for it. It also proposes two inconsistency indicators for pairwise comparisons. The primary motivation for the inconsistency reduction is expressed by a computer industry concept “garbage in, garbage out”. The quality of the output depends on the quality of the input.

Ranking from pairwise comparisons is a ubiquitous problem and has been studied in disciplines ranging from statistics to operations research and from theoretical computer science to machine learning. Here we consider a general setting where outcomes of pairwise comparisons between items i and j are drawn probabilistically by flipping a coin with unknown bias Pij , and ask under what conditions ...

the purpose of this paper is to introduce the concept of pairwise f-closedness in bitopological spaces. this space contains both of pairwise strongcompactness and pairwise s-closedness and contained in pairwise quasi h-closedness. the characteristics and relationships concerning this new class ofspaces with other corresponding types are established. moreover, several ofits basic and important p...