Papers
Topics
Authors
Recent
Search
2000 character limit reached

Pairwise Comparisons Simplified

Published 27 Nov 2013 in cs.DM and cs.GT | (1311.6863v1)

Abstract: This study examines the notion of generators of a pairwise comparisons matrix. Such approach decreases the number of pairwise comparisons from $n\cdot (n-1)$ to $n-1$. An algorithm of reconstructing of the PC matrix from its set of generators is presented.

Citations (42)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Authors (2)

  1. W. W. Koczkodaj 
  2. J. Szybowski 

Collections

Sign up for free to add this paper to one or more collections.

Sign Up