In this paper it is shown how to compute stable sets, defined by Mertens (1989), inthe context of bimatrix games only using linear optimization techniques.

Combinatorial optimization problems arise in several areas ranging from management to mathematics and graph theory. Most combinatorial optimization problems are computationally hard due to the restriction that a subset of the variables have to take integral values. During the last two decades...

In this paper it is shown how to compute stable sets, defined by Mertens (1989), inthe context of bimatrix games only using linear optimization techniques.

In this document we consider an optimization problem which origins from freight exchanges. The aim is to increase the utilization of already scheduled road transportation activities by accepting extra loads. Such utilization increase reduces costs for the freight sender, increases revenue for...