Many cooperative games, especially ones stemming from resource pooling in<br/>queuing or inventory systems, are based on situations in which each player is associated with a single attribute (a real number representing, say, a demand) and in which the cost to optimally serve any sum of attributes is...

In this paper we characterize the smallest production possibility set that contains a specified set of (input, output) combinations. In accordance with neoclassical production economics, this possibility set has convex projections into the input and output spaces (convex isoquants), and it...

In this paper, a method for estimating monotone, convex and log-concave densities is proposed. The estimation procedure consists of an unconstrained kernel estimator which is modi?ed in a second step with respect to the desired shape constraint by using monotone rearrangements. It is shown that...

In this paper we are concerned with shape restricted estimation in inverse regression problems with convolution-type operator. We use increasing rearrangements to compute increasingand convex estimates from an (in principle arbitrary) unconstrained estimate of the unknown regression function. An...

The Bertrand Oligopoly situation with Shubik's demand functions is modelled as a cooperative TU game. For that purpose two optimization problems are solved to arrive at the description of the worth of any coalition in the so-called Bertrand Oligopoly Game. Under certain circumstances, this...