We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming … problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself …

We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming … problems with a min-sum or min-max objective function. Our algorithms run in polynomial time if the optimization problem itself …

provide a polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with …

In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The … algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying … dimension. Conditions are stated under which the algorithm terminates with a simplex one of whose vertices is an integral …

-called peer group games being non-negative additive games on a permission tree. We provide a polynomial time algorithm for …

algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The algorithm starts with a … stated under which the algorithm terminates with a simplex one of whose vertices is an integral solution of the …

This discussion paper resulted in a publication in the 'International Journal of Game Theory', 2011, 40, 591-616.<P> A … polynomial time algorithm for computing the nucleolus of the restricted games corresponding to a class of games with permission …