We propose three mechanisms to reach compromise between two opposing parties. They are based on the use of Rules k Names, whereby one parties proposes a shortlist and other chooses from it. Methods this class used in practice appoint Supreme Court justices have been recently proposed for arbitration selection processes. Those we suggest flexible allow participate endogenous determination role p...

Stochastic Programming (SP) has long been considered as a well-justified yet computationally challenging paradigm for practical applications. Computational studies in the literature often involve approximating a large number of scenarios by using a small number of scenarios to be processed via deterministic solvers, or running Sample Average Approximation on some genre of high performance machi...

We study a concept in multicriteria optimization called compromise solutions (introduced in 1973 by Yu [20]) and a generalized version of this, termed reference point solutions. Our main result shows the power of this concept: Approximating reference point solutions is polynomially equivalent to constructing an approximate Pareto set as in [16]. A reference point solution is the solution closes...