In this paper we consider a simulated annealing algorithm for multiobjective optimization problems. With a suitable choice of the acceptance probabilities, the algorithm is shown to converge asymptotically, that is, the Markov chain that describes the algorithm converges with probability one to...

This paper deals with continuous-time zero-sum two-person Markov games with denumerable state space, general (Borel) action spaces and possibly unbounded transition and reward/cost rates. We analyze the bias optimality and the weakly overtaking optimality criteria. An example shows that, in...

This paper introduces a multiobjective control formulation of the priority assignment (PA) problem for a discrete-time single-server queueing system with q competing classes of customers, and the discounted cost criterion. A multiobjective priority assignment (MPA) problem is presented, which is...

This paper deals with discrete-time Markov control processes in Borel spaces, with unbounded rewards. The criterion to be optimized is a long-run sample-path (or pathwise) average reward subject to constraints on a long-run pathwise average cost. To study this pathwise problem, we give...

This paper deals with denumerable-state continuous-time controlled Markov chains with possibly unbounded transition and reward rates. It concerns optimality criteria that improve the usual expected average reward criterion. First, we show the existence of average reward optimal policies with...

We consider constrained discounted-cost Markov control processes in Borel spaces, with unbounded costs. Conditions are given for the constrained problem to be solvable, and also equivalent to an equality-constrained (EC) linear program. In addition, it is shown that there is no duality gap...

This paper gives conditions for the convergence of the Laurent series expansion for a class of continuous-time controlled Markov chains with possibly unbounded reward (or cost) rates and unbounded transition rates. That series is then used to study several optimization criteria, including...

In this paper we consider a simulated annealing algorithm for multiobjective optimization problems. With a suitable choice of the acceptance probabilities, the algorithm is shown to converge asymptotically, that is, the Markov chain that describes the algorithm converges with probability one to...

This paper concerns a class of nonstationary discrete-time stochastic noncooperative games. Our goals are threefold. First, we give conditions to find Nash equilibria by means of the Euler equation approach. Second, we identify subclasses of dynamic potential games. Finally, within one of this...