The objective pursued in this paper is two-fold. The first part addresses the following combinatorial problem: is it possible to construct an infinite sequence over n letters where each letter is… Expand

Preface.- Part I: Theoretical Foundations: Multimodularity, Convexity and Optimization Balanced Sequences Stochastic Event Graphs Applications in Queuing Networks Optimal Routing in two Deterministic Queues.Expand

The goal of this paper is to provide a theory of N-person Markov games with unbounded cost, for a countable state space and compact action spaces.Expand

We consider an exponential queue with arrival and service rates depending on the number of jobs present in the queue. The queueing system is controlled by restricting arrivals. Typically, a good… Expand

We investigate the computation of optimal policies in constrained discrete stochastic dynamic programming with the average reward as utility function.Expand

This paper is the second part of our study of Blackwell optimal policies in Markov decision chains with a Borel state space and unbounded rewards.Expand

In this paper we consider a discrete-time Markov decision chain with a denumerable state space and compact action sets and we assume that for all states the rewards and transition probabilities… Expand

A general method to obtain insensitive upper and lower bounds for the stationary distribution of queueing networks is sketched. It is applied to an overflow model. The bounds are shown to be valid… Expand