We discuss in this paper statistical inference of sample average approximations of multistage stochastic programming problems. We show that any random sampling scheme provides a valid statistical lower bound for the optimal (minimum) value of the true problem. However, in order for such lower...

Neighbor games arise from certain matching or sequencing situations in which only some specific pairs of players can obtain a positive gain. As a consequence, the class of neighbor games is the intersection of the class of assignment games (Shapley and Shubik (1972)) and the class of component...

We study a replacement system with discrete-time Markovian deterioration and finite state space {0, …,N}. State 0 stands for a new system, and the larger the state the worse the condition of the system with N as the failure state. We impose the condition that the long-term fraction of...

The problem of fair zone design for local public transportation networks is considered. A network model which was introduced by Hamacher and Schöbel in [2] is investigated. We present theoretical results for special transportation networks and heuristic algorithms for the general problem....

Algorithms generating piecewise linear approximations of the nondominated set for general, convex and nonconvex, multicriteria programs are developed. Polyhedral distance functions are used to construct the approximation and evaluate its quality. The functions automatically adapt to the problem...

This paper considers a like-queue production system in which server vacations and breakdowns are possible. The decision-maker can turn a single server on at any arrival epoch or off at any service completion. We model the system by an M<Superscript>[x]</Superscript>/M/1 queueing system with N policy. The server can be...</superscript>

Inventory cost games are introduced in Meca et al. (1999). These games arise when considering the possibility of joint ordering in n-person EOQ inventory situations. Moreover, the SOC-rule is introduced and analysed as a cost allocation rule for this type of situations. In the current paper it...

This paper deals with a Markovian decision process with an absorbing set J <Subscript>0</Subscript>. We are interested in the largest number β<Superscript>*</Superscript>≥1, called the critical discount factor, such that for all discount factors β smaller than β<Superscript>*</Superscript> the limit V of the N-stage value function V <Subscript>N</Subscript> for N →∞ exists and is...</subscript></superscript></superscript></subscript>

We consider Markov Modulated Bernoulli Processes (MMBP) where the success probability of a Bernoulli process evolves over time according to a Markov chain. The MMBP is applied in reliability modeling where systems and components function in a randomly changing environment. Some of these...

A canonical procedure is described, which associates to each infinite information collecting situation a related information collecting situation with finite state and action spaces, in such a way that the two corresponding IC-games are near to each other. Compensations for informants are then...