Tsitsiklis John N.

John N. Tsitsiklis

Information about the author John N. Tsitsiklis will soon be added to the site.
Found 11 papers in total
Bias and variance approximation in value function estimates
Bias and variance approximation in value function estimates
2007
We consider a finite-state, finite-action, infinite-horizon, discounted reward Markov...
NP-hardness of checking the unichain condition in average cost Markov decision processes
NP-hardness of checking the unichain condition in average cost Markov decision processes
2007
The unichain condition requires that every policy in an MDP result in a single ergodic...
Dynamic catalog mailing policies
Dynamic catalog mailing policies
2006
Deciding who should receive a mail-order catalog is among the most important decisions...
Efficiency loss in a network resource allocation game
Efficiency loss in a network resource allocation game
2004
We explore the properties of a congestion game in which users of a congested resource...
On the empirical state–action frequencies in Markov decision processes under general policies
On the empirical state–action frequencies in Markov decision processes under general policies
2005
We consider the empirical state–action frequencies and the empirical reward in...
Stochastic shortest path problems with recourse
Stochastic shortest path problems with recourse
1996
We consider shortest path problems defined on graphs with random arc costs. We assume...
Large deviations analysis of the generalized processor sharing policy
Large deviations analysis of the generalized processor sharing policy
1999
In this paper we consider a stochastic server (modeling a multiclass communication...
Rollout algorithms for combinatorial optimization
Rollout algorithms for combinatorial optimization
1997
We consider the approximate solution of discrete optimization problems using...
Dynamic shortest paths in acyclic networks with Markovian arc costs
Dynamic shortest paths in acyclic networks with Markovian arc costs
1993
The authors examine shortest path problems in acyclic networks in which arc costs are...
An analysis of stochastic shortest path problems
An analysis of stochastic shortest path problems
1991
The authors consider a stochastic version of the classical shortest path problem...
Markov chains with rare transitions and simulated annealing
Markov chains with rare transitions and simulated annealing
1989
We consider ‘approximately stationary’ Markov chains in which the entries...
Papers per page: