Implementations of PACMAN

PACMAN (Passive and Active Compensability Multicriteria ANalysis) is a multiple criteria methodology based on a decision maker oriented notion of compensation, called compensability. An important feature of PACMAN is a possible asymmetry of the connected decision procedure, since compensability is determined for each ordered pair of criteria, distinguishing the compensating criterion from the compensated one. Here we give a notion of implementation of PACMAN, which allows a concrete modelization of a multiple criteria decision problem. We study regular implementations of PACMAN and their monotonicity properties. We also examine several regular implementations, which satisfy some additional properties. Particular emphasis is given to a regular implementation of PACMAN that produces the lexicographic ordering

Passive and Active Compensability Multicriteria ANalysis (PACMAN) is a multiple criteria methodology based on a decision maker oriented notion of compensation, called compensability. An important feature of PACMAN is a possible asymmetry of the connected decision procedure, since compensability is determined for each ordered pair of criteria, distinguishing the compensating criterion from the compensated one. Here we give a notion of implementation of PACMAN, which allows a concrete modelization of a multiple criteria decision problem. We study regular implementations of PACMAN and their monotonicity properties. We also examine several regular implementations, which satisfy some additional properties. Particular emphasis is given to a regular implementation of PACMAN that produces the lexicographic ordering.