In this note we represent a classical bankruptcy problem as a standard flow problem on a simple network and implement some known division rules from the bankruptcy literature via suitable cost functions in the related minimum cost flow problem.

We consider a market situation with two corners. One corner consists of a single seller with one object, and the other corner consists of potential buyers who all want the object. We suppose that the valuations of the object for the different buyers are known by all of them. Then two types of...

We consider a market situation with two corners. One corner consists of a single seller with one object, and the other corner consists of potential buyers who all want the object. We suppose that the valuations of the object for the different buyers is known by all of them. Then two cooperative...

In this paper we consider one-machine sequencing situations with interval data. We present different possible scenarioes and extend classical results on well known rules and on sequencing games to the interval setting

We consider a market situation with two corners. One corner consists of a single seller with one object, and the other corner consists of potential buyers who all want the object. We suppose that the valuations of the object for the different buyers are known by all of them. Then two types of...

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a 'dualize and restrict' procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each...

We provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. As it turns out, a cooperative game is convex if and only if all its marginal games are superadditive, and a monotonic game satisfying the veto player property with...

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each...