SIMPSON POINTS IN PLANAR PROBLEMS WITH LOCATIONAL CONSTRAINTS - THE ROUND-NORM CASE

The Simpson set is one of the most popular solution concepts in locati on models with voting. In this paper we address the problem of finding such a set for planar models with locational constraints when the met ric in use is induced by a round norm, After formulating the problem a s a mathematical program, we first propose a general algorithm that en ables the evaluation of the corresponding objective function, Then, we show how to solve the problem by proving the existence of a finite do minating set of locations, the best of which can be found by inspectio n (using the evaluation algorithm proposed).