The following pages link to John N. Tsitsiklis (Q290261):
Displaying 50 items.
- (Q197785) (redirect page) (← links)
- When is a pair of matrices mortal? (Q290262) (← links)
- Pricing of fluctuations in electricity markets (Q319744) (← links)
- Optimal scaling of average queue sizes in an input-queued switch: an open problem (Q383214) (← links)
- Efficiency loss in a Cournot oligopoly with convex market demand (Q406255) (← links)
- An efficient algorithm for multiple simultaneous broadcasts in the hypercube (Q685525) (← links)
- Convexity and characterization of optimal policies in a dynamic routing problem (Q786781) (← links)
- Some aspects of parallel and distributed iterative algorithms - a survey (Q805158) (← links)
- A comparison of Jacobi and Gauss-Seidel parallel iterations (Q918136) (← links)
- Approachability in repeated games: Computational aspects and a Stackelberg variant (Q1021600) (← links)
- Communication complexity of convex optimization (Q1100896) (← links)
- A note on strategy elimination in bimatrix games (Q1102210) (← links)
- Decentralized detection by a large number of sensors (Q1111520) (← links)
- On the control of discrete-event dynamical systems (Q1123861) (← links)
- The complexity of dynamic programming (Q1262227) (← links)
- On the large deviations behavior of acyclic networks of \(G/G/1\) queues (Q1296715) (← links)
- Complexity of stability and controllability of elementary hybrid systems (Q1301420) (← links)
- Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance (Q1327604) (← links)
- A short proof of the Gittins index theorem (Q1327612) (← links)
- Asynchronous stochastic approximation and Q-learning (Q1345139) (← links)
- The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate (Q1367098) (← links)
- The boundedness of all products of a pair of matrices is undecidable (Q1583220) (← links)
- On average versus discounted reward temporal-difference learning (Q1604814) (← links)
- The sample complexity of worst-case identification of FIR linear systems (Q1803842) (← links)
- Average cost temporal-difference learning (Q1805802) (← links)
- On the use of random numbers in asynchronous simulation via rollback (Q1825689) (← links)
- Approximate gradient methods in policy-space optimization of Markov reward processes (Q1870312) (← links)
- Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions (Q1872422) (← links)
- Convergence rate of linear two-time-scale stochastic approximation. (Q1879892) (← links)
- Worst-case identification of nonlinear fading memory systems (Q1893013) (← links)
- Feature-based methods for large scale dynamic programming (Q1911341) (← links)
- NP-hardness of deciding convexity of quartic polynomials and related problems (Q1942256) (← links)
- Estimation of time-varying parameters in statistical models: An optimization approach (Q1964326) (← links)
- Large deviations analysis of the generalized processor sharing policy (Q1975018) (← links)
- A lower bound on the queueing delay in resource constrained load balancing (Q2192743) (← links)
- A simple criterion for structurally fixed modes (Q2266025) (← links)
- Algorithmic aspects of mean-variance optimization in Markov decision processes (Q2356186) (← links)
- Active learning using arbitrary binary valued queries (Q2366678) (← links)
- Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks (Q2443186) (← links)
- Profit loss in Cournot oligopolies (Q2450679) (← links)
- NP-hardness of checking the unichain condition in average cost MDPs (Q2467470) (← links)
- Linear stochastic approximation driven by slowly varying Markov chains (Q2503529) (← links)
- A contract-based model for directed network formation (Q2507673) (← links)
- Rollout algorithms for combinatorial optimization (Q2567853) (← links)
- Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard (Q2730242) (← links)
- The Complexity of Optimal Queuing Network Control (Q2757596) (← links)
- Optimization of Radiation Therapy Fractionation Schedules in the Presence of Tumor Repopulation (Q2802256) (← links)
- Coordination with Local Information (Q2830747) (← links)
- Efficiency Loss in a Cournot Oligopoly with Convex Market Demand (Q2840916) (← links)
- Parameterized Supply Function Bidding: Equilibrium and Efficiency (Q2879504) (← links)
