Ausgehend von kontinuierlichen 1-Standortproblemen wird in diesem Paper eine neue Klasse von kostenbasierten TU-Spielen eingeführt. Es werden einige hinreichende Bedingungen präsentiert unter denen ein Spiel in dieser Klasse einen nicht-leeren Kern hat. Weiterhin werden Zuordnungsregeln für...

In this paper we consider the general question in the field of mathematics of whether some properties or algorithms that hold in finite dimension spaces also hold in function spaces. We answer this question concerning the very well-known Weiszfeld algorithm for the Weber problem. In order to do...

We introduce the path player game, a noncooperative network game with a continuum of mutually dependent set of strategies. This game models network flows from the point of view of competing network operators. The players are represented by paths in the network. They have to decide how much flow...

When dealing with location problems we are usually given a set of existing facilities and we are looking for the location of one or several new facilities. In the classical approaches weights are assigned to existing facilities expressing the importance of the new facilities for the existing...