We consider a situation in which a group of banks consider connecting their Automated Teller Machines (ATMs) in a network, so that the banks’ customers may use ATMs of any bank in the network. The problem studied is that of allocating the total transaction costs arising in the network, among...

In this paper we consider standard fixed tree games, for which each vertex unequal to the root is inhabited by exactly one player. We present two weighted allocation rules, the weighted down-home allocation and the weighted neighbour-home allocation, both inspired by the painting story in...

In this paper we consider standard fixed tree games, for which each vertex unequal to the root is inhabited by exactly one player. We present two weighted allocation rules, the weighted down-home allocation and the weighted neighbour-home allocation, both inspired by the painting story in...

We consider a situation in which a group of banks consider connecting their Automated Teller Machines (ATMs) in a network, so that the banks customers may use ATMs of any bank in the network. The problem studied is that of allocating the total transaction costs arising in the network, among the...

We study the problem of allocating the total profit of a production enterprise among the resource owners, using the game-theoretic framework introduced by Owen [Owen, G., 1975. On the core of linear production games. Mathematical Programming 9, 358-370]. We provide lower (upper) bounds on the...