Consider a situation where a group of agents wishes to share the costs of their joint actions, and needs to determine how to distribute the costs amongst themselves in a fair manner. For example, a set of agents may agree to process their jobs together on a machine, and share the optimal cost of scheduling these jobs. This kind of situation can be modelled naturally as a cooperative game. In th...

Article history: Received 24 February 2012 Available online 14 October 2013 JEL classification: C72

This short note discusses open problems and partial solutions related to Sheldon M Ross's second conjecture about the classical single server queue subject a randomly time-varying rate arrival rate.

Control scheduling refers to the problem of assigning agents or actuators act upon a dynamical system at specific times so as minimize quadratic control cost, such objectives linear-quadratic-Gaussian (LQG) linear regulator problems. When budget operational constraints are imposed on schedule, this is in general NP-hard and its solution can therefore only be approximated even for moderately siz...

We analyze a routing scheme for a broad class of networks which converges (in the Cesaro sense) with probability one to the set of approximate Cesaro–Wardrop equilibria, an extension of the notion of a Wardrop equilibrium. The network model allows for wireline networks where delays are caused by flows on links, as well as wireless networks, a primary motivation for us, where delays are caused b...

On the OrliczCesaro sequence spaces ( ces ) which are defined by using Orlicz function , we show that the space ces equipped with both Amemiya and Luxemburg norms possesses uniform Opial property and uniform Kadec-Klee property if satisfy the 52 -condition.