Back to results
US 2006/0224530 A1Published application
Polycriteria transitivity process
OwnerJeffrey Riggs, Holland Coulter +1inventors
InventorsJeffrey Riggs, Holland Coulter, Jennifer Lefeaux
Life of this patent
Estimating the term…
Abstract
A method for ordering pairwise value comparisons between members of a set, such as those comparisons made as part of the Analytic Hierarchy Process (AHP). The process enhances the overall consistency in the set of judgments by aiding the decision maker in coping with large judgment sets and by preserving the transitivity of the judgments. A matrix is created having entries relating to the value assigned to the pairwise comparisons.
Claims24
A method of ranking and illustrating pairwise comparisons between all of the elements in a set of n elements, comprising the steps of:
- a) ranking the order of each of the n elements, from the most preferred element to the least preferred element;
- b) creating an n×n matrix utilizing n row headings, listing said n elements from top to bottom extending from the most preferred element to the least preferred element, said n×n matrix also including n column headings listing said n elements, extending from the most preferred element to the least preferred element, said matrix including a diagonal extending from the top left corner of said matrix to the bottom right corner of said matrix, said diagonal dividing said matrix into a top half and a bottom half;
- c) pairwise comparing said most preferred element to said least preferred element;
- d) assigning a value of the comparison in step c) utilizing a numeric scale extending from a first limit to a second limit;
- e) inserting said value assigned in step d) into the appropriate entry of said n×n matrix;
- f) pairwise comparing said most preferred element to the remaining elements;
- g) assigning a value between said first and second limit for each of said comparisons in step f);
- h) inserting each of said values determined in step f) into the appropriate matrix entry of said matrix, ensuring that each of said values has the appropriate numeric relationship with its neighboring entries, each of said entries being made in said top half of said matrix, thereby completing a row of said matrix;
- i) making a pairwise comparison between all of said elements in the next row of said matrix;
- j) assigning a value between said first and second limit for each of said pairwise comparisons in step i);
- k) inserting each of said values into the appropriate matrix entry of the next row of said matrix, ensuring that each of said values has the appropriate relationship with its neighboring entries, each of said entries being made in said top half of said matrix;
- and
- l) repeating steps i), j), and k) until all of the entries are made in said top half of said matrix.
10 more elements
A method of ranking and illustrating pairwise comparisons between all of the elements in a set of n elements, comprising the steps of:
- a) ranking the order of each of the n elements, from the least preferred element to the most preferred element;
- b) creating an n×n matrix utilizing n row headings, listing said n elements from top to bottom extending from the least preferred element to the most preferred element, said n×n matrix also including n column headings listing said n elements, extending from the least preferred element to the most preferred element, said matrix including a diagonal extending from the top left corner of said matrix to the bottom right corner of said matrix, said diagonal dividing said matrix into a top half and a bottom half;
- c) pairwise comparing said least preferred element to said most preferred element;
- d) assigning a value of the comparison in step c) utilizing a numeric scale extending from a first limit to a second limit;
- e) inserting said value assigned in step d) into the appropriate entry of said n×n matrix;
- f) pairwise comparing said least preferred element to the remaining elements;
- g) assigning a value between said first and second limit for each of said comparisons in step f);
- h) inserting each of said values determined in step f) into the appropriate matrix entry of said matrix, ensuring that each of said values has the appropriate numeric relationship with its neighboring entries, each of said entries being made in said top half of said matrix;
- i) making a pairwise comparison between all of said elements in the next row of said matrix, thereby completing a row of said matrix;
- j) assigning a value between said first and second limit for each of said pairwise comparisons in step i);
- k) inserting each of said values into the appropriate matrix entry of the next row of said matrix, ensuring that each of said values has the appropriate relationship with its neighboring entries, each of said entries being made in said top half of said matrix;
- and
- l) repeating steps i), j), and k) until all of the entries are made in said top half of said matrix.
10 more elements
Dependencies are inferred from the claim text.