Abstract: This paper investigates two related questions: (1) How to derive a confidence interval for the output of a combination of simulation inputs not yet simulated? (2) How to select the next combination to be simulated when searching for the optimal combination? To answer these questions,...

Most of the known efficient algorithms designed to compute the nucleolus for special classes of balanced games are based on two facts: (i) in any balanced game, the coalitions which actually determine the nucleolus are essential; and (ii) all essential coalitions in any of the games in the class...

In this paper we study competitive outcomes and endogenous coalition formation in a cooperative n-person transferable utility (TU) game from the viewpoint of general equilibrium theory.For any given game, we construct a competitive exchange coalition production economy corresponding to the game....

AMS classification: 90D12;

This paper considers one machine job scheduling situations or sequencing problems, where clients can have more than a single job to be processed in order to get a final output.Moreover, a job can be of interest for different players. This means that one of the main assumptions in classic...

This paper analyzes convex congestion network problems.It is shown that for network problems with convex congestion costs, an algorithm based on a shortest path algorithm, can be used to find an optimal network for any coalition. Furthermore an easy way of determining if a given network is...

We consider the allocation of a finite number of indivisible objects to the same number of agents according to an exogenously given queue.We assume that the agents collaborate in order to achieve an efficient outcome for society.We allow for side-payments and provide a method for obtaining...