This paper introduces a framework for joint hub network development. Building a joint physical hub for transhipment of goods is expensive and therefore involves considerable risks for the cooperating companies. In a practical setting, it is unlikely that an entire network will be built at once....

For one of the most prominent solution concepts for cooperative TU games, we show that in the weighted case the nucleolus tends to the weights as the number of players increases under very mild conditions. We give a sufficient characterization for the case of coincidence between weights and...

This paper proposes a novel method of global optimization based on host-parasite co-evolution. It also develops a Fortran-77 code for the algorithm. The algorithm has been tested on 100 benchmark functions (of which the results of 32 relatively harder problems have been reported). In its search...

The phrase \add them up and divide by two (Tashite Ni De Waru, in Japanese)" is an established maxim in Japanese society, and has its historical roots in Japanese culture. This means adopting a middle course between two competing proposals in order to avoid a conflict. In the spirit of Max Weber...

In this paper we propose a new rule to allocate risk capital to portfolios or divisions within a firm. Specifically, we determine the capital allocation that minimizes the excesses of sets of portfolios in lexicographical sense. The excess of a set of portfolios is defined as the expected loss...

We consider upper and lower bounds for maxmin allocations of a completely divisible good in both competitive and cooperative strategic contexts. We then derive a subgradient algorithm to compute the exact value up to any fixed degree of precision

The core of games arising from semi-infinite transportation situations with infinitely divisible goods is studied. In these situations one aims at maximizing the profit from transporting a good from a finite number of suppliers to an infinite number of demanders. This good is infinitely...

Games corresponding to semi-infinite transportation and related assignment situations are studied. In a semi-infinite transportation situation, one aims at maximizing the profit from the transportation of a certain good from a finite number of suppliers to an infinite number of demanders. An...

We study linear production situations with an infinite number of production techniques. Such a situation gives rise to a semi-infinite linear program. Related to this program, we introduce primal and dual games and study relations between these games, the cores of these games and the so-called...

Weighted voting games are frequently used in decision making. Each voter has a weight and a proposal is accepted if the weight sum of the supporting voters exceeds a quota. One line of research is the efficient computation of so-called power indices measuring the influence of a voter. We treat...