NAME

war - break one big decision into lots of little decisions

SYNOPSIS

war [--help] [--man] [--version]
war [--graph] --file sourcefile
war [--graph] alt1 alt2 alt3 ...

DESCRIPTION

Imagine you're at a department store, trying to choose one china pattern out of a dozen or more alternatives. How do you do it? If none stands out as the clear winner, you might apply a process of elimination to your choices, until a winner emerges.

This application applies a process similar to that described above: first, the set of alternatives is defined. Then pairs of alternatives are presented to the user, who chooses one "winner" from each pair. The process continues until an unambiguous ordering of the alternatives is known.

OPTIONS

--file filename, -f filename

Reads the list of alternatives from file filename, a text file containing the items to be ranked. Blank lines are ignored, as well as lines starting with the pound (#) character.

--graph, -g

When the results are shown to the user, also display a textual representation of the preference graph.

--help, -h, -?

Display simple command-line options.

--man

Display detailed script information.

--version, -v

Shows the current script version.

EXAMPLE

To choose our favorite bug, we could do the following:

% war aphid bee cricket
Choose one of the following:
<1> aphid
<2> bee
2
Choose one of the following:
<1> cricket
<2> bee
1
===== final preference order =====
cricket
bee
aphid
%

SEE ALSO

App::War

Information on access to the source code, bug tracking, and smoke testing can be found in the App::War documentation.

http://en.wikipedia.org/wiki/Paired_comparison

http://en.wikipedia.org/wiki/Law_of_comparative_judgment

http://en.wikipedia.org/wiki/Analytic_Hierarchy_Process

http://www.kittenwar.com

AUTHOR

John Trammell, <johntrammell@gmail.com>