John N. Tsitsiklis

From MaRDI portal
Person:290261

Available identifiers

zbMath Open tsitsiklis.john-nWikidataQ27049813 ScholiaQ27049813MaRDI QIDQ290261

List of research outcomes





PublicationDate of PublicationType
Jumping Fluid Models and Delay Stability of Max-Weight Dynamics Under Heavy-Tailed Traffic2024-02-23Paper
Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems2022-09-26Paper
Private Sequential Learning2022-02-16Paper
Blind Identification of Stochastic Block Models from Dynamical Observations2022-02-03Paper
Fluctuation Bounds for the Max-Weight Policy with Applications to State Space Collapse2020-10-16Paper
Sensitivity to Cumulative Perturbations for a Class of Piecewise Constant Hybrid Systems2020-10-07Paper
Delay-Predictability Trade-offs in Reaching a Secret Goal2020-10-05Paper
A lower bound on the queueing delay in resource constrained load balancing2020-08-17Paper
Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems2020-06-18Paper
Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations2020-03-12Paper
Bayesian Detection in Bounded Height Tree Networks2018-07-09Paper
On the Impact of Node Failures and Unreliable Communications in Dense Sensor Networks2018-06-27Paper
Flexible Queueing Architectures2017-12-15Paper
Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems2017-09-08Paper
Degree Fluctuations and the Convergence Time of Consensus Algorithms2017-09-08Paper
Distributed Anonymous Discrete Function Computation2017-08-25Paper
A Lower Bound for Distributed Averaging Algorithms on the Line Graph2017-08-25Paper
On the Nonexistence of Quadratic Lyapunov Functions for Consensus Algorithms2017-08-08Paper
On Distributed Averaging Algorithms and Quantization Effects2017-08-08Paper
A Structured Multiarmed Bandit Problem and the Greedy Policy2017-08-08Paper
On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity2017-08-08Paper
Comments on “Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules”2017-07-27Paper
Hardness of Low Delay Network Scheduling2017-07-12Paper
Efficiency loss in a network resource allocation game: the case of elastic supply2017-07-12Paper
On Learning With Finite Memory2017-06-08Paper
Throughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Traffic2017-05-16Paper
When Is a Network Epidemic Hard to Eliminate?2017-04-13Paper
On Queue-Size Scaling for Input-Queued Switches2017-01-18Paper
Coordination with local information2016-10-31Paper
Pricing of fluctuations in electricity markets2016-10-06Paper
When is a pair of matrices mortal?2016-06-01Paper
Optimization of radiation therapy fractionation schedules in the presence of tumor repopulation2016-04-25Paper
https://portal.mardi4nfdi.de/entity/Q34525872015-11-13Paper
Algorithmic aspects of mean-variance optimization in Markov decision processes2015-07-29Paper
Efficiency loss in a Cournot oligopoly with convex market demand2014-09-08Paper
https://portal.mardi4nfdi.de/entity/Q51688502014-07-21Paper
Profit loss in Cournot oligopolies2014-05-14Paper
Qualitative properties of \(\alpha\)-fair policies in bandwidth-sharing networks2014-04-04Paper
Optimal scaling of average queue sizes in an input-queued switch: an open problem2013-11-25Paper
Efficiency Loss in a Cournot Oligopoly with Convex Market Demand2013-07-24Paper
NP-hardness of deciding convexity of quartic polynomials and related problems2013-03-18Paper
Commentary: Perspectives on stochastic optimization over time2012-07-28Paper
Delay Stability Regions of the Max-Weight Policy under Heavy-Tailed Traffic2012-07-24Paper
Online learning with sample path constraints2012-04-17Paper
Parameterized supply function bidding: equilibrium and efficiency2012-03-26Paper
Bias and Variance Approximation in Value Function Estimates2012-02-21Paper
Convergence Speed in Distributed Consensus and Averaging2012-01-09Paper
Efficiency of Scalar-Parameterized Mechanisms2011-11-24Paper
https://portal.mardi4nfdi.de/entity/Q30931972011-10-12Paper
Max-Weight Scheduling in Queueing Networks with Heavy-Tailed Traffic2011-08-01Paper
Error Exponents for Decentralized Detection in Tree Networks2011-06-01Paper
Linearly Parameterized Bandits2011-04-27Paper
https://portal.mardi4nfdi.de/entity/Q30848522011-03-25Paper
Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications2011-03-21Paper
Queue Length Asymptotics for Generalized Max-Weight Scheduling in the presence of Heavy-Tailed Traffic2010-07-24Paper
A lower bound for distributed averaging algorithms2010-03-30Paper
Lower bounds on the sample complexity of exploration in the multi-armed bandit problem.2010-03-23Paper
Convergence speed in distributed consensus and averaging2010-03-15Paper
Robust Management of Motion Uncertainty in Intensity-Modulated Radiation Therapy2009-08-13Paper
A Single-Unit Decomposition Approach to Multiechelon Inventory Systems2009-08-13Paper
Approachability in repeated games: Computational aspects and a Stackelberg variant2009-06-08Paper
On the Subexponential Decay of Detection Error Probabilities in Long Tandems2009-02-24Paper
Data Fusion Trees for Detection: Does Architecture Matter?2009-02-24Paper
Bin Packing with Queues2009-01-21Paper
Asymptotic Performance of a Censoring Sensor Network2008-12-21Paper
Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity2008-12-21Paper
Stochastic Search in a Forest Revisited2008-05-27Paper
Distributed Subgradient Methods and Quantization Effects2008-03-07Paper
NP-hardness of checking the unichain condition in average cost MDPs2008-01-21Paper
A game theoretic view of efficiency loss in resource allocation2007-10-23Paper
Online Learning with Constraints2007-09-14Paper
A contract-based model for directed network formation2006-10-05Paper
Linear stochastic approximation driven by slowly varying Markov chains2006-09-21Paper
Feature-based methods for large scale dynamic programming2006-06-29Paper
Efficiency Loss in a Network Resource Allocation Game2005-11-11Paper
On the Empirical State-Action Frequencies in Markov Decision Processes Under General Policies2005-11-11Paper
Rollout algorithms for combinatorial optimization2005-10-13Paper
Convergence rate of linear two-time-scale stochastic approximation.2004-09-15Paper
10.1162/1532443037689661022004-08-10Paper
OnActor-Critic Algorithms2004-01-08Paper
Approximate gradient methods in policy-space optimization of Markov reward processes2003-05-11Paper
Performance of multiclass Markovian queueing networks via piecewise linear Lyapunov functions2003-05-06Paper
The stability of saturated linear dynamical systems is undecidable2002-10-15Paper
A survey of computational complexity results in systems and control2002-08-05Paper
Simulation-based optimization of Markov reward processes2002-07-21Paper
On average versus discounted reward temporal-difference learning2002-07-08Paper
On the large deviations behavior of acyclic networks of \(G/G/1\) queues2001-12-09Paper
The complexity of optimal queuing network control2001-11-26Paper
Deciding stability and mortality of piecewise affine dynamical systems2001-08-20Paper
Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard2001-08-05Paper
https://portal.mardi4nfdi.de/entity/Q45015562001-06-28Paper
The boundedness of all products of a pair of matrices is undecidable2000-10-26Paper
Gradient Convergence in Gradient methods with Errors2000-10-19Paper
Optimal stopping of Markov processes: Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives2000-10-17Paper
Complexity of stability and controllability of elementary hybrid systems2000-09-10Paper
Estimation of time-varying parameters in statistical models: An optimization approach2000-06-13Paper
Large deviations analysis of the generalized processor sharing policy2000-03-30Paper
Average cost temporal-difference learning2000-02-28Paper
Overview of complexity and decidability results for three classes of elementary nonlinear systems1999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42684551999-10-31Paper
https://portal.mardi4nfdi.de/entity/Q42572161999-08-09Paper
An analysis of temporal-difference learning with function approximation1999-05-06Paper
Implementation of efficient algorithms for globally optimal trajectories1998-08-23Paper
Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach1998-08-23Paper
The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate1998-05-12Paper
NP-Hardness of Some Linear Control Design Problems1998-02-09Paper
On the average communication complexity of asynchronous distributed algorithms1998-02-02Paper
Stability conditions for multiclass fluid queueing networks1997-01-15Paper
Stochastic shortest path problems with recourse1996-08-05Paper
Branching bandits and Klimov's problem: achievable region and side constraints1996-06-13Paper
Feature-based methods for large scale dynamic programming1996-04-21Paper
https://portal.mardi4nfdi.de/entity/Q48661401996-03-04Paper
Worst-case identification of nonlinear fading memory systems1995-11-28Paper
Efficient algorithms for globally optimal trajectories1995-10-30Paper
A short proof of the Gittins index theorem1995-07-06Paper
Data fusion with minimal communication1995-03-01Paper
Asynchronous stochastic approximation and Q-learning1995-02-26Paper
Some properties of optimal thresholds in decentralized detection1994-10-12Paper
Extremal properties of likelihood-ratio quantizers1994-10-11Paper
Optimization of multiclass queueing networks: Polyhedral and nonlinear characterizations of achievable performance1994-10-10Paper
Optimal asymptotic identification under bounded disturbances1994-03-27Paper
On the communication complexity of distributed algebraic computation1994-03-24Paper
An efficient algorithm for multiple simultaneous broadcasts in the hypercube1993-10-17Paper
Active learning using arbitrary binary valued queries1993-08-18Paper
Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs1993-08-09Paper
The sample complexity of worst-case identification of FIR linear systems1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q40351651993-05-18Paper
https://portal.mardi4nfdi.de/entity/Q40314211993-04-01Paper
https://portal.mardi4nfdi.de/entity/Q40015231992-09-18Paper
Special cases of traveling salesman and repairman problems with time windows1992-07-23Paper
An Analysis of Stochastic Shortest Path Problems1992-06-27Paper
An optimal one-way multigrid algorithm for discrete-time stochastic control1992-06-26Paper
Some aspects of parallel and distributed iterative algorithms - a survey1991-01-01Paper
On the Communication Complexity of Solving a Polynomial Equation1991-01-01Paper
Partially Asynchronous, Parallel Algorithms for Network Flow and Other Problems1990-01-01Paper
On the settling time of the congested GI/G/1 queue1990-01-01Paper
The complexity of dynamic programming1989-01-01Paper
On the control of discrete-event dynamical systems1989-01-01Paper
A comparison of Jacobi and Gauss-Seidel parallel iterations1989-01-01Paper
Markov Chains with Rare Transitions and Simulated Annealing1989-01-01Paper
On the use of random numbers in asynchronous simulation via rollback1989-01-01Paper
A note on strategy elimination in bimatrix games1988-01-01Paper
Decentralized detection by a large number of sensors1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38070141988-01-01Paper
The Complexity of Markov Decision Processes1987-01-01Paper
On the stability of asynchronous iterative processes1987-01-01Paper
Communication complexity of convex optimization1987-01-01Paper
On Stochastic Scheduling with In-Tree Precedence Constraints1987-01-01Paper
Analysis of a multiaccess control scheme1987-01-01Paper
Distributed asynchronous optimal routing in data networks1986-01-01Paper
Distributed asynchronous deterministic and stochastic gradient optimization algorithms1986-01-01Paper
Intractable Problems in Control Theory1986-01-01Paper
A lemma on the multiarmed bandit problem1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37024991986-01-01Paper
On the complexity of decentralized decision making and detection problems1985-01-01Paper
A fast algorithm for linear estimation of two- dimensional isotropic random fields1985-01-01Paper
Convexity and characterization of optimal policies in a dynamic routing problem1984-01-01Paper
Convergence and asymptotic agreement in distributed decision problems1984-01-01Paper
A simple criterion for structurally fixed modes1984-01-01Paper
Guaranteed robustness properties of multivariable nonlinear stochastic optimal regulators1984-01-01Paper
Periodic Review Inventory Systems with Continuous Demand and Discrete Order Sizes1984-01-01Paper
On the complexity of designing distributed protocols1982-01-01Paper

Research outcomes over time

This page was built for person: John N. Tsitsiklis