default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn N. Tsitsiklis
Person information
- affiliation: Massachusetts Institute of Technology, Cambridge, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j134]David Gamarnik
, John N. Tsitsiklis, Martin Zubeldia:
Stability, Memory, and Messaging Trade-Offs in Heterogeneous Service Systems. Math. Oper. Res. 47(3): 1862-1874 (2022)- 2021
- [j133]John N. Tsitsiklis, Kuang Xu, Zhi Xu:
Private Sequential Learning. Oper. Res. 69(5): 1575-1590 (2021) - [i27]Arsalan Sharif-Nassab, John N. Tsitsiklis:
Jumping Fluid Models and Delay Stability of Max-Weight Dynamics under Heavy-Tailed Traffic. CoRR abs/2111.07420 (2021) - 2020
- [j132]Michael T. Schaub, Santiago Segarra, John N. Tsitsiklis:
Blind Identification of Stochastic Block Models from Dynamical Observations. SIAM J. Math. Data Sci. 2(2): 335-367 (2020) - [j131]Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani:
Sensitivity to Cumulative Perturbations for a Class of Piecewise Constant Hybrid Systems. IEEE Trans. Autom. Control. 65(3): 1057-1072 (2020) - [i26]David Gamarnik, John N. Tsitsiklis, Martin Zubeldia:
Stability, memory, and messaging tradeoffs in heterogeneous service systems. CoRR abs/2007.07219 (2020)
2010 – 2019
- 2019
- [i25]Michael T. Schaub, Santiago Segarra, John N. Tsitsiklis:
Blind identification of stochastic block models from dynamical observations. CoRR abs/1905.09107 (2019) - [i24]Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani:
Nonexpansive Piecewise Constant Hybrid Systems are Conservative. CoRR abs/1905.12361 (2019) - 2018
- [j130]John N. Tsitsiklis, Kuang Xu:
Delay-Predictability Trade-offs in Reaching a Secret Goal. Oper. Res. 66(2): 587-596 (2018) - [j129]Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Delay Analysis of the Max-Weight Policy Under Heavy-Tailed Traffic via Fluid Approximations. Math. Oper. Res. 43(2): 460-493 (2018) - [c64]John N. Tsitsiklis, Kuang Xu, Zhi Xu:
Private Sequential Learning. COLT 2018: 721-727 - [i23]John N. Tsitsiklis, Kuang Xu, Zhi Xu:
Private Sequential Learning. CoRR abs/1805.02136 (2018) - [i22]Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani:
Sensitivity to Cumulative Perturbations for a Class of Piecewise Constant Hybrid Systems. CoRR abs/1807.08139 (2018) - [i21]Arsalan Sharif-Nassab, John N. Tsitsiklis, S. Jamaloddin Golestani:
Fluctuation Bounds for the Max-Weight Policy, with Applications to State Space Collapse. CoRR abs/1810.09180 (2018) - 2017
- [j128]John N. Tsitsiklis, Kuang Xu:
Flexible Queueing Architectures. Oper. Res. 65(5): 1398-1413 (2017) - [j127]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
When Is a Network Epidemic Hard to Eliminate? Math. Oper. Res. 42(1): 1-14 (2017) - 2016
- [j126]Munther A. Dahleh, Alireza Tahbaz-Salehi, John N. Tsitsiklis, Spyros I. Zoumpoulis:
Technical Note - Coordination with Local Information. Oper. Res. 64(3): 622-637 (2016) - [j125]Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Delay Stability of Back-Pressure Policies in the Presence of Heavy-Tailed Traffic. IEEE/ACM Trans. Netw. 24(4): 2046-2059 (2016) - [c63]David Gamarnik, John N. Tsitsiklis, Martin Zubeldia:
Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems. SIGMETRICS 2016: 1-12 - 2015
- [j124]John N. Tsitsiklis, Yunjian Xu:
Pricing of fluctuations in electricity markets. Eur. J. Oper. Res. 246(1): 199-208 (2015) - [j123]Thomas Bortfeld, Jagdish Ramakrishnan, John N. Tsitsiklis, Jan Unkelbach:
Optimization of Radiation Therapy Fractionation Schedules in the Presence of Tumor Repopulation. INFORMS J. Comput. 27(4): 788-803 (2015) - [j122]Jimmy Q. Li, Paat Rusmevichientong, Duncan Simester, John N. Tsitsiklis, Spyros I. Zoumpoulis:
The Value of Field Experiments. Manag. Sci. 61(7): 1722-1740 (2015) - [c62]Julien M. Hendrickx, John N. Tsitsiklis:
Fundamental limitations for anonymous distributed systems with broadcast communications. Allerton 2015: 9-16 - [c61]Munther A. Dahleh, John N. Tsitsiklis, Spyros I. Zoumpoulis:
The value of temporal data for learning of influence networks: A characterization via Kullback-Leibler divergence. CDC 2015: 2907-2912 - [c60]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
A lower bound on the performance of dynamic curing policies for epidemics on graphs. CDC 2015: 3560-3567 - [i20]John N. Tsitsiklis, Kuang Xu:
Flexible Queueing Architectures. CoRR abs/1505.07648 (2015) - [i19]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
When is a network epidemic hard to eliminate? CoRR abs/1510.06054 (2015) - [i18]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
A lower bound on the performance of dynamic curing policies for epidemics on graphs. CoRR abs/1510.06055 (2015) - 2014
- [j121]Munther A. Dahleh, Alireza Tahbaz-Salehi, John N. Tsitsiklis, Spyros I. Zoumpoulis:
Coordination with local information. SIGMETRICS Perform. Evaluation Rev. 41(4): 29 (2014) - [j120]Krishna P. Jagannathan, Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Throughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Traffic. IEEE Trans. Inf. Theory 60(5): 2896-2909 (2014) - [j119]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
An Efficient Curing Policy for Epidemics on Graphs. IEEE Trans. Netw. Sci. Eng. 1(2): 67-75 (2014) - [j118]Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic. IEEE/ACM Trans. Netw. 22(1): 257-270 (2014) - [c59]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
An efficient curing policy for epidemics on graphs. CDC 2014: 4447-4454 - [c58]Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Delay stability of back-pressure policies in the presence of heavy-tailed traffic. ITA 2014: 1-10 - [c57]Munther A. Dahleh, John N. Tsitsiklis, Spyros I. Zoumpoulis:
The Value of Temporally Richer Data for Learning of Influence Networks. WINE 2014: 322-323 - [i17]Devavrat Shah, John N. Tsitsiklis, Yuan Zhong:
On Queue-Size Scaling for Input-Queued Switches. CoRR abs/1405.4764 (2014) - [i16]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
An efficient curing policy for epidemics on graphs. CoRR abs/1407.2241 (2014) - 2013
- [j117]Shie Mannor, John N. Tsitsiklis:
Algorithmic aspects of mean-variance optimization in Markov decision processes. Eur. J. Oper. Res. 231(3): 645-653 (2013) - [j116]Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Parrilo, John N. Tsitsiklis:
NP-hardness of deciding convexity of quartic polynomials and related problems. Math. Program. 137(1-2): 453-476 (2013) - [j115]John N. Tsitsiklis, Yunjian Xu:
Profit loss in Cournot oligopolies. Oper. Res. Lett. 41(4): 415-420 (2013) - [j114]Julien M. Hendrickx, John N. Tsitsiklis:
Convergence of Type-Symmetric and Cut-Balanced Consensus Seeking Systems. IEEE Trans. Autom. Control. 58(1): 214-218 (2013) - [j113]Alex Olshevsky, John N. Tsitsiklis:
Degree Fluctuations and the Convergence Time of Consensus Algorithms. IEEE Trans. Autom. Control. 58(10): 2626-2631 (2013) - [j112]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
On Learning With Finite Memory. IEEE Trans. Inf. Theory 59(10): 6859-6872 (2013) - [c56]Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Delay analysis of the Max-Weight policy under heavy-tailed traffic via fluid approximations. Allerton 2013: 436-444 - [c55]John N. Tsitsiklis, Kuang Xu:
Queueing system topologies with limited flexibility. SIGMETRICS 2013: 167-178 - 2012
- [j111]Krishna P. Jagannathan, Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Queue-Length Asymptotics for Generalized Max-Weight Scheduling in the Presence of Heavy-Tailed Traffic. IEEE/ACM Trans. Netw. 20(4): 1096-1111 (2012) - [c54]John N. Tsitsiklis, Yunjian Xu:
Pricing of fluctuations in electricity markets. CDC 2012: 457-464 - [c53]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
Conditions for learning in generalized tandem networks. CDC 2012: 7437-7444 - [c52]John N. Tsitsiklis, Yunjian Xu:
Efficiency Loss in a Cournot Oligopoly with Convex Market Demand. GAMENETS 2012: 63-76 - [c51]Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Max-weight scheduling in networks with heavy-tailed traffic. INFOCOM 2012: 2318-2326 - [i15]Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Delay Stability Regions of the Max-Weight Policy under Heavy-Tailed Traffic. CoRR abs/1207.5746 (2012) - [i14]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
On Learning with Finite Memory. CoRR abs/1209.1122 (2012) - 2011
- [j110]Ramesh Johari, John N. Tsitsiklis:
Parameterized Supply Function Bidding: Equilibrium and Efficiency. Oper. Res. 59(5): 1079-1089 (2011) - [j109]Anna Scaglione, Mark Coates, Michael Gastpar, John N. Tsitsiklis, Martin Vetterli:
Introduction to the Issue on Gossiping Algorithms Design and Applications. IEEE J. Sel. Top. Signal Process. 5(4): 645-648 (2011) - [j108]Devavrat Shah, John N. Tsitsiklis, Yuan Zhong:
Optimal scaling of average queue sizes in an input-queued switch: an open problem. Queueing Syst. Theory Appl. 68(3-4): 375-384 (2011) - [j107]Alexander Olshevsky, John N. Tsitsiklis:
Convergence Speed in Distributed Consensus and Averaging. SIAM Rev. 53(4): 747-772 (2011) - [j106]Julien M. Hendrickx, Alexander Olshevsky, John N. Tsitsiklis:
Distributed Anonymous Discrete Function Computation. IEEE Trans. Autom. Control. 56(10): 2276-2289 (2011) - [j105]Alexander Olshevsky, John N. Tsitsiklis:
A Lower Bound for Distributed Averaging Algorithms on the Line Graph. IEEE Trans. Autom. Control. 56(11): 2694-2698 (2011) - [j104]Devavrat Shah, David N. C. Tse, John N. Tsitsiklis:
Hardness of Low Delay Network Scheduling. IEEE Trans. Inf. Theory 57(12): 7810-7817 (2011) - [j103]O. Patrick Kreidl, John N. Tsitsiklis, Spyros I. Zoumpoulis:
On Decentralized Detection With Partial Information Sharing Among Sensors. IEEE Trans. Signal Process. 59(4): 1759-1765 (2011) - [c50]Julien M. Hendrickx, John N. Tsitsiklis:
A new condition for convergence in continuous-time consensus seeking systems. CDC/ECC 2011: 5070-5075 - [c49]Alexander Olshevsky, John N. Tsitsiklis:
Degree fluctuations and the convergence time of consensus algorithms. CDC/ECC 2011: 6602-6607 - [c48]Wee-Peng Tay, John N. Tsitsiklis:
Error exponents for decentralized detection in feedback architectures. ICASSP 2011: 2496-2499 - [c47]Shie Mannor, John N. Tsitsiklis:
Mean-Variance Optimization in Markov Decision Processes. ICML 2011: 177-184 - [c46]Krishna P. Jagannathan, Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Queue length asymptotics for generalized max-weight scheduling in the presence of heavy-tailed traffic. INFOCOM 2011: 2318-2326 - [c45]John N. Tsitsiklis, Kuang Xu:
On the power of (even a little) centralization in distributed processing. SIGMETRICS 2011: 161-172 - [i13]Julien M. Hendrickx, John N. Tsitsiklis:
Convergence of type-symmetric and cut-balanced consensus seeking systems. CoRR abs/1102.2361 (2011) - [i12]Alexander Olshevsky, John N. Tsitsiklis:
Degree Fluctuations and the Convergence Time of Consensus Algorithms. CoRR abs/1104.0454 (2011) - [i11]Shie Mannor, John N. Tsitsiklis:
Mean-Variance Optimization in Markov Decision Processes. CoRR abs/1104.5601 (2011) - [i10]Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Max-Weight Scheduling in Queueing Networks with Heavy-Tailed Traffic. CoRR abs/1108.0370 (2011) - 2010
- [j102]John N. Tsitsiklis:
Commentary - Perspectives on Stochastic Optimization Over Time. INFORMS J. Comput. 22(1): 18-19 (2010) - [j101]Paat Rusmevichientong, John N. Tsitsiklis:
Linearly Parameterized Bandits. Math. Oper. Res. 35(2): 395-411 (2010) - [j100]Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis:
Continuous-Time Average-Preserving Opinion Dynamics with Opinion-Dependent Communications. SIAM J. Control. Optim. 48(8): 5214-5240 (2010) - [c44]Krishna Jagannathan, Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Throughput optimal scheduling in the presence of heavy-tailed traffic. Allerton 2010: 953-960 - [c43]John N. Tsitsiklis, Yunjian Xu:
Bayesian proportional resource allocation games. Allerton 2010: 1556-1561 - [c42]O. Patrick Kreidl, John N. Tsitsiklis, Spyros I. Zoumpoulis:
Decentralized detection in sensor network architectures with feedback. Allerton 2010: 1605-1609 - [c41]Alexander Olshevsky, John N. Tsitsiklis:
A lower bound for distributed averaging algorithms on the line graph. CDC 2010: 4523-4528 - [c40]Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis:
Opinion dynamics for agents with opinion-dependent connections. CDC 2010: 6626-6632 - [c39]Florence Bénézit, Vincent D. Blondel, Patrick Thiran, John N. Tsitsiklis, Martin Vetterli:
Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices. ISIT 2010: 1753-1757 - [c38]Devavrat Shah, John N. Tsitsiklis, Yuan Zhong:
Qualitative properties of alpha-weighted scheduling policies. SIGMETRICS 2010: 239-250 - [i9]Devavrat Shah, John N. Tsitsiklis, Yuan Zhong:
Qualitative Properties of alpha-Weighted Scheduling Policies. CoRR abs/1003.5979 (2010) - [i8]Julien M. Hendrickx, Alexander Olshevsky, John N. Tsitsiklis:
Distributed anonymous discrete function computation. CoRR abs/1004.2102 (2010) - [i7]Krishna P. Jagannathan, Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Queue Length Asymptotics for Generalized Max-Weight Scheduling in the presence of Heavy-Tailed Traffic. CoRR abs/1007.4286 (2010) - [i6]Amir Ali Ahmadi, Alexander Olshevsky, Pablo A. Parrilo, John N. Tsitsiklis:
NP-hardness of Deciding Convexity of Quartic Polynomials and Related Problems. CoRR abs/1012.1908 (2010)
2000 – 2009
- 2009
- [j99]Shie Mannor, John N. Tsitsiklis:
Approachability in repeated games: Computational aspects and a Stackelberg variant. Games Econ. Behav. 66(1): 315-325 (2009) - [j98]Ramesh Johari, John N. Tsitsiklis:
Efficiency of Scalar-Parameterized Mechanisms. Oper. Res. 57(4): 823-839 (2009) - [j97]Shie Mannor, John N. Tsitsiklis, Jia Yuan Yu:
Online Learning with Sample Path Constraints. J. Mach. Learn. Res. 10: 569-590 (2009) - [j96]Alexander Olshevsky, John N. Tsitsiklis:
Convergence Speed in Distributed Consensus and Averaging. SIAM J. Control. Optim. 48(1): 33-55 (2009) - [j95]Angelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis:
On Distributed Averaging Algorithms and Quantization Effects. IEEE Trans. Autom. Control. 54(11): 2506-2517 (2009) - [j94]Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis:
On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity. IEEE Trans. Autom. Control. 54(11): 2586-2597 (2009) - [j93]Adam J. Mersereau, Paat Rusmevichientong, John N. Tsitsiklis:
A Structured Multiarmed Bandit Problem and the Greedy Policy. IEEE Trans. Autom. Control. 54(12): 2787-2802 (2009) - [j92]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
Bayesian detection in bounded height tree networks. IEEE Trans. Signal Process. 57(10): 4042-4051 (2009) - [c37]Mihalis G. Markakis, Eytan H. Modiano, John N. Tsitsiklis:
Scheduling policies for single-hop networks with heavy-tailed traffic. Allerton 2009: 112-120 - [c36]Julien M. Hendrickx, Alex Olshevsky, John N. Tsitsiklis:
Distributed anonymous function computation in information fusion and multiagent systems. Allerton 2009: 1582-1589 - [i5]Julien M. Hendrickx, Alexander Olshevsky, John N. Tsitsiklis:
Distributed anonymous function computation in information fusion and multiagent systems. CoRR abs/0907.2949 (2009) - 2008
- [j91]Alp Muharremoglu, John N. Tsitsiklis:
A Single-Unit Decomposition Approach to Multiechelon Inventory Systems. Oper. Res. 56(5): 1089-1103 (2008) - [j90]Thomas Bortfeld, Timothy C. Y. Chan, Alexei Trofimov, John N. Tsitsiklis:
Robust Management of Motion Uncertainty in Intensity-Modulated Radiation Therapy. Oper. Res. 56(6): 1461-1473 (2008) - [j89]Alexander Olshevsky, John N. Tsitsiklis:
On the Nonexistence of Quadratic Lyapunov Functions for Consensus Algorithms. IEEE Trans. Autom. Control. 53(11): 2642-2645 (2008) - [j88]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
Data Fusion Trees for Detection: Does Architecture Matter? IEEE Trans. Inf. Theory 54(9): 4155-4168 (2008) - [j87]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
On the Subexponential Decay of Detection Error Probabilities in Long Tandems. IEEE Trans. Inf. Theory 54(10): 4767-4771 (2008) - [j86]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
On the Impact of Node Failures and Unreliable Communications in Dense Sensor Networks. IEEE Trans. Signal Process. 56(6): 2535-2546 (2008) - [c35]Angelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis:
Distributed subgradient methods and quantization effects. CDC 2008: 4177-4184 - [c34]Angelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis:
On distributed averaging algorithms and quantization effects. CDC 2008: 4825-4830 - [c33]Adam J. Mersereau, Paat Rusmevichientong, John N. Tsitsiklis:
A structured multiarmed bandit problem and the greedy policy. CDC 2008: 4945-4950 - [i4]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
Data Fusion Trees for Detection: Does Architecture Matter? CoRR abs/0803.2337 (2008) - [i3]Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis:
On Krause's consensus formation model with state-dependent connectivity. CoRR abs/0807.2028 (2008) - [i2]Paat Rusmevichientong, John N. Tsitsiklis:
Linearly Parameterized Bandits. CoRR abs/0812.3465 (2008) - 2007
- [j85]Shie Mannor, Duncan Simester, Peng Sun, John N. Tsitsiklis:
Bias and Variance Approximation in Value Function Estimates. Manag. Sci. 53(2): 308-322 (2007) - [j84]Jay Sethuraman, John N. Tsitsiklis:
Stochastic Search in a Forest Revisited. Math. Oper. Res. 32(3): 589-593 (2007) - [j83]John N. Tsitsiklis:
NP-Hardness of checking the unichain condition in average cost MDPs. Oper. Res. Lett. 35(3): 319-323 (2007) - [j82]Dimitri P. Bertsekas, John N. Tsitsiklis:
Comments on "Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules". IEEE Trans. Autom. Control. 52(5): 968-969 (2007) - [j81]Dimitri P. Bertsekas, John N. Tsitsiklis:
Erratum to "Comments on 'Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules'". IEEE Trans. Autom. Control. 52(7): 1356 (2007) - [j80]Anand Ganti, Eytan H. Modiano, John N. Tsitsiklis:
Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity. IEEE Trans. Inf. Theory 53(3): 998-1008 (2007) - [j79]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
Asymptotic Performance of a Censoring Sensor Network. IEEE Trans. Inf. Theory 53(11): 4191-4209 (2007) - [c32]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
Bayesian Detection in Bounded Height Tree Networks. DCC 2007: 243-252 - [c31]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
On the Sub-Exponential Decay of Detection Error Probabilities in Long Tandems. ICASSP (2) 2007: 837-840 - [c30]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
Detection in Dense Wireless Sensor Networks. WCNC 2007: 3483-3488 - 2006
- [j78]Ramesh Johari, Shie Mannor, John N. Tsitsiklis:
A contract-based model for directed network formation. Games Econ. Behav. 56(2): 201-224 (2006) - [j77]Ramesh Johari, John N. Tsitsiklis:
A scalable network resource allocation mechanism with bounded efficiency loss. IEEE J. Sel. Areas Commun. 24(5): 992-999 (2006) - [j76]Duncan Simester, Peng Sun, John N. Tsitsiklis:
Dynamic Catalog Mailing Policies. Manag. Sci. 52(5): 683-696 (2006) - [j75]Alvin Fu, Eytan H. Modiano, John N. Tsitsiklis:
Optimal transmission scheduling over a fading channel with energy and deadline constraints. IEEE Trans. Wirel. Commun. 5(3): 630-641 (2006) - [c29]Alex Olshevsky, John N. Tsitsiklis:
Convergence Rates in Distributed Consensus and Averaging. CDC 2006: 3387-3392 - [c28]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
Censoring Sensors: Asymptotics and the Value of Cooperation. CISS 2006: 62-67 - [c27]Shie Mannor, John N. Tsitsiklis:
Online Learning with Constraints. COLT 2006: 529-543 - [c26]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
Asymptotically Optimal Distributed Censoring. ISIT 2006: 625-629 - 2005
- [j74]Shie Mannor, John N. Tsitsiklis:
On the Empirical State-Action Frequencies in Markov Decision Processes Under General Policies. Math. Oper. Res. 30(3): 545-561 (2005) - [j73]Ramesh Johari, Shie Mannor, John N. Tsitsiklis:
Efficiency loss in a network resource allocation game: the case of elastic supply. IEEE Trans. Autom. Control. 50(11): 1712-1724 (2005) - [c25]Vincent D. Blondel, Julien M. Hendrickx, Alex Olshevsky, John N. Tsitsiklis:
Convergence in Multiagent Coordination, Consensus, and Flocking. CDC/ECC 2005: 2996-3000 - [i1]Ramesh Johari, Shie Mannor, John N. Tsitsiklis:
Efficiency Loss in a Network Resource Allocation Game: The Case of Elastic Supply. CoRR abs/cs/0506054 (2005) - 2004
- [j72]Shie Mannor, John N. Tsitsiklis:
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem. J. Mach. Learn. Res. 5: 623-648 (2004) - [j71]Ramesh Johari, John N. Tsitsiklis:
Efficiency Loss in a Network Resource Allocation Game. Math. Oper. Res. 29(3): 407-435 (2004) - [c24]Ramesh Johari, John N. Tsitsiklis:
Routing and peering in a competitive Internet. CDC 2004: 1556-1561 - [c23]Ramesh Johari, Shie Mannor, John N. Tsitsiklis:
Efficiency loss in a resource allocation game: A single link in elastic supply. CDC 2004: 4679-4683 - [c22]Shie Mannor, Duncan Simester, Peng Sun, John N. Tsitsiklis:
Bias and variance in value function estimation. ICML 2004 - 2003
- [j70]Peter Marbach, John N. Tsitsiklis:
Approximate Gradient Methods in Policy-Space Optimization of Markov Reward Processes. Discret. Event Dyn. Syst. 13(1-2): 111-148 (2003) - [j69]Vijay R. Konda, John N. Tsitsiklis:
Linear stochastic approximation driven by slowly varying Markov chains. Syst. Control. Lett. 50(2): 95-102 (2003) - [j68]Vijay R. Konda, John N. Tsitsiklis:
OnActor-Critic Algorithms. SIAM J. Control. Optim. 42(4): 1143-1166 (2003) - [j67]Alvin Fu, Eytan H. Modiano, John N. Tsitsiklis:
Optimal energy allocation and admission control for communications satellites. IEEE/ACM Trans. Netw. 11(3): 488-500 (2003) - [c21]Ramesh Johari, John N. Tsitsiklis:
Network resource allocation and a congestion game: the single link case. CDC 2003: 2112-2117 - [c20]Shie Mannor, John N. Tsitsiklis:
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem. COLT 2003: 418-432 - [c19]Alvin Fu, Eytan H. Modiano, John N. Tsitsiklis:
Optimal Energy Allocation for Delay-Constrained Data Transmission over a Time-Varying Channel. INFOCOM 2003: 1095-1105 - 2002
- [j66]John N. Tsitsiklis:
On the Convergence of Optimistic Policy Iteration. J. Mach. Learn. Res. 3: 59-72 (2002) - [j65]John N. Tsitsiklis, Benjamin Van Roy:
On Average Versus Discounted Reward Temporal-Difference Learning. Mach. Learn. 49(2-3): 179-191 (2002) - [c18]Alvin Fu, Eytan H. Modiano, John N. Tsitsiklis:
Optimal Energy Allocation and Admission Control for Communications Satellites. INFOCOM 2002: 648-656 - 2001
- [j64]Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis:
The Stability of Saturated Linear Dynamical Systems Is Undecidable. J. Comput. Syst. Sci. 62(3): 442-462 (2001) - [j63]Peter Marbach, John N. Tsitsiklis:
Simulation-based optimization of Markov reward processes. IEEE Trans. Autom. Control. 46(2): 191-209 (2001) - [j62]Vincent D. Blondel, Olivier Bournez, Pascal Koiran, Christos H. Papadimitriou, John N. Tsitsiklis:
Deciding stability and mortality of piecewise affine dynamical systems. Theor. Comput. Sci. 255(1-2): 687-696 (2001) - [j61]John N. Tsitsiklis, Benjamin Van Roy:
Regression methods for pricing complex American-style options. IEEE Trans. Neural Networks 12(4): 694-703 (2001) - [c17]C. I. Boussios, Munther A. Dahleh, John N. Tsitsiklis:
Semiglobal nonlinear stabilization via approximate policy iteration. ACC 2001: 4675-4680 - 2000
- [j60]Vincent D. Blondel, John N. Tsitsiklis:
A survey of computational complexity results in systems and control. Autom. 36(9): 1249-1274 (2000) - [j59]Peter Marbach, Oliver Mihatsch, John N. Tsitsiklis:
Call admission control and routing in integrated services networks using neuro-dynamic programming. IEEE J. Sel. Areas Commun. 18(2): 197-208 (2000) - [j58]Dimitri P. Bertsekas, John N. Tsitsiklis:
Gradient Convergence in Gradient methods with Errors. SIAM J. Optim. 10(3): 627-642 (2000) - [j57]Vincent D. Blondel, Stéphane Gaubert, John N. Tsitsiklis:
Approximating the spectral radius of sets of matrices in the max-algebra is NP-hard. IEEE Trans. Autom. Control. 45(9): 1762-1765 (2000) - [j56]Ioannis Ch. Paschalidis, John N. Tsitsiklis:
Congestion-dependent pricing of network services. IEEE/ACM Trans. Netw. 8(2): 171-184 (2000) - [c16]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Performance of multiclass Markovian queueing networks. CDC 2000: 534-539 - [c15]Vincent D. Blondel, Olivier Bournez, Pascal Koiran, John N. Tsitsiklis:
The Stability of Saturated Linear Dynamical Systems Is Undecidable. STACS 2000: 479-490
1990 – 1999
- 1999
- [j55]Vincent D. Blondel, John N. Tsitsiklis:
Complexity of stability and controllability of elementary hybrid systems. Autom. 35(3): 479-489 (1999) - [j54]John N. Tsitsiklis, Benjamin Van Roy:
Average cost temporal-difference learning. Autom. 35(11): 1799-1808 (1999) - [j53]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach. Mach. Learn. 35(3): 225-245 (1999) - [j52]Christos H. Papadimitriou, John N. Tsitsiklis:
The Complexity of Optimal Queuing Network Control. Math. Oper. Res. 24(2): 293-305 (1999) - [j51]Dimitris Bertsimas, Ioannis Ch. Paschalidis, John N. Tsitsiklis:
Large deviations analysis of the generalized processor sharing policy. Queueing Syst. Theory Appl. 32(4): 319-349 (1999) - [j50]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Performance analysis of multiclass queueing networks. SIGMETRICS Perform. Evaluation Rev. 27(3): 11-14 (1999) - [j49]John N. Tsitsiklis, Benjamin Van Roy:
Optimal stopping of Markov processes: Hilbert space theory, approximation algorithms, and an application to pricing high-dimensional financial derivatives. IEEE Trans. Autom. Control. 44(10): 1840-1851 (1999) - [c14]Vijay R. Konda, John N. Tsitsiklis:
Actor-Critic Algorithms. NIPS 1999: 1008-1014 - 1998
- [j48]Lazaros C. Polymenakos, Dimitri P. Bertsekas, John N. Tsitsiklis:
Implementation of efficient algorithms for globally optimal trajectories. IEEE Trans. Autom. Control. 43(2): 278-283 (1998) - [j47]Dimitris Bertsimas, Ioannis Ch. Paschalidis, John N. Tsitsiklis:
Asymptotic buffer overflow probabilities in multiclass multiplexers: an optimal control approach. IEEE Trans. Autom. Control. 43(3): 315-335 (1998) - 1997
- [b4]Dimitris Bertsimas, John N. Tsitsiklis:
Introduction to linear optimization. Athena scientific optimization and computation series 6, Athena Scientific 1997, ISBN 978-1-886529-19-9, pp. I-XV, 1-587 - [j46]Dimitri P. Bertsekas, John N. Tsitsiklis, Cynara Wu:
Rollout Algorithms for Combinatorial Optimization. J. Heuristics 3(3): 245-262 (1997) - [j45]Vincent D. Blondel, John N. Tsitsiklis:
When is a Pair of Matrices Mortal? Inf. Process. Lett. 63(5): 283-286 (1997) - [j44]John N. Tsitsiklis, Vincent D. Blondel:
The Lyapunov exponent and joint spectral radius of pairs of matrices are hard - when not impossible - to compute and to approximate. Math. Control. Signals Syst. 10(1): 31-40 (1997) - [j43]John N. Tsitsiklis, Vincent D. Blondel:
Lyapunov exponents of pairs of matrices, a correction. Math. Control. Signals Syst. 10(4): 381 (1997) - [j42]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Correction to "Stability Conditions for Multiclass Fluid Queueing Networks". IEEE Trans. Autom. Control. 42(1): 128 (1997) - [j41]John N. Tsitsiklis, Benjamin Van Roy:
An analysis of temporal-difference learning with function approximation. IEEE Trans. Autom. Control. 42(5): 674-690 (1997) - [c13]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Estimation of Time-Varying Parameters in Statistical Models: An Optimization Approach. COLT 1997: 314-324 - [c12]Peter Marbach, John N. Tsitsiklis:
A neuro-dynamic programming approach to admission control in ATM networks: the single link case. ICASSP 1997: 159-162 - [c11]Peter Marbach, Oliver Mihatsch, Miriam Schulte, John N. Tsitsiklis:
Reinforcement Learning for Call Admission Control and Routing in Integrated Service Networks. NIPS 1997: 922-928 - 1996
- [b3]Dimitri P. Bertsekas, John N. Tsitsiklis:
Neuro-dynamic programming. Optimization and neural computation series 3, Athena Scientific 1996, ISBN 1886529108, pp. I-XIII, 1-491 - [j40]John N. Tsitsiklis, Benjamin Van Roy:
Feature-Based Methods for Large Scale Dynamic Programming. Mach. Learn. 22(1-3): 59-94 (1996) - [j39]George H. Polychronopoulos, John N. Tsitsiklis:
Stochastic shortest path problems with recourse. Networks 27(2): 133-143 (1996) - [j38]Dimitris Bertsimas, David Gamarnik, John N. Tsitsiklis:
Stability conditions for multiclass fluid queueing networks. IEEE Trans. Autom. Control. 41(11): 1618-1631 (1996) - [c10]John N. Tsitsiklis, Benjamin Van Roy:
Analysis of Temporal-Diffference Learning with Function Approximation. NIPS 1996: 1075-1081 - [c9]John N. Tsitsiklis, Benjamin Van Roy:
Approximate Solutions to Optimal Stopping Problems. NIPS 1996: 1082-1088 - 1995
- [j37]Munther A. Dahleh, Eduardo D. Sontag, David N. C. Tse, John N. Tsitsiklis:
Worst-case identification of nonlinear fading memory systems. Autom. 31(3): 503-508 (1995) - [j36]John N. Tsitsiklis, George D. Stamoulis:
On the Average Communication Complexity of Asynchronous Distributed Algorithms. J. ACM 42(2): 382-400 (1995) - [j35]David N. C. Tse, Robert G. Gallager, John N. Tsitsiklis:
Statistical Multiplexing of Multiple Time-Scale Markov Streams. IEEE J. Sel. Areas Commun. 13(6): 1028-1038 (1995) - [j34]John N. Tsitsiklis:
Efficient algorithms for globally optimal trajectories. IEEE Trans. Autom. Control. 40(9): 1528-1538 (1995) - [j33]Dimitris Bertsimas, Ioannis Ch. Paschalidis, John N. Tsitsiklis:
Branching bandits and Klimov's problem: achievable region and side constraints. IEEE Trans. Autom. Control. 40(12): 2063-2075 (1995) - [c8]Benjamin Van Roy, John N. Tsitsiklis:
Stable LInear Approximations to Dynamic Programming for Stochastic Control Problems with Local Transitions. NIPS 1995: 1045-1051 - 1994
- [j32]John N. Tsitsiklis:
Asynchronous Stochastic Approximation and Q-Learning. Mach. Learn. 16(3): 185-202 (1994) - [j31]Sanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis:
Local Versus Nonlocal Computation of Length of Digitized Curves. IEEE Trans. Pattern Anal. Mach. Intell. 16(7): 711-718 (1994) - [j30]William W. Irving, John N. Tsitsiklis:
Some properties of optimal thresholds in decentralized detection. IEEE Trans. Autom. Control. 39(4): 835-838 (1994) - [j29]George D. Stamoulis, John N. Tsitsiklis:
The efficiency of greedy routing in hypercubes and butterflies. IEEE Trans. Commun. 42(11): 3051-3061 (1994) - [j28]Zhi-Quan Luo, John N. Tsitsiklis:
Data fusion with minimal communication. IEEE Trans. Inf. Theory 40(5): 1551-1563 (1994) - [c7]Christos H. Papadimitriou, John N. Tsitsiklis:
The Complexity of Optimal Queueing Network Control. SCT 1994: 318-322 - 1993
- [j27]Harilaos N. Psaraftis, John N. Tsitsiklis:
Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs. Oper. Res. 41(1): 91-101 (1993) - [j26]George D. Stamoulis, John N. Tsitsiklis:
An Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube. Inf. Process. Lett. 46(5): 219-224 (1993) - [j25]Zhi-Quan Luo, John N. Tsitsiklis:
On the Communication Complexity of Distributed Algebraic Computation. J. ACM 40(5): 1019-1047 (1993) - [j24]Sanjeev R. Kulkarni, Sanjoy K. Mitter, John N. Tsitsiklis:
Active Learning Using Arbitrary Binary Valued Queries. Mach. Learn. 11: 23-35 (1993) - [j23]Sanjeev R. Kulkarni, Sanjoy K. Mitter, John N. Tsitsiklis, Ofer Zeitouni:
PAC Learning with Generalized Samples and an Applicaiton to Stochastic Geometry. IEEE Trans. Pattern Anal. Mach. Intell. 15(9): 933-942 (1993) - [j22]David N. C. Tse, Munther A. Dahleh, John N. Tsitsiklis:
Optimal asymptotic identification under bounded disturbances. IEEE Trans. Autom. Control. 38(8): 1176-1190 (1993) - [j21]John N. Tsitsiklis:
Extremal properties of likelihood-ratio quantizers. IEEE Trans. Commun. 41(4): 550-558 (1993) - [j20]George D. Stamoulis, John N. Tsitsiklis:
Efficient Routing Schemes for Multiple Broadcasts in Hypercubes. IEEE Trans. Parallel Distributed Syst. 4(7): 725-739 (1993) - [c6]Sanjeev R. Kulkarni, Sanjoy K. Mitter, T. J. Richardson, John N. Tsitsiklis:
Local Versus Non-local Computation of Length of Digitized Curves. FSTTCS 1993: 94-103 - 1992
- [j19]John N. Tsitsiklis:
Special cases of traveling salesman and repairman problems with time windows. Networks 22(3): 263-282 (1992) - [c5]Sanjeev R. Kulkarni, John N. Tsitsiklis, Sanjoy K. Mitter, Ofer Zeitouni:
PAC Learning With Generalized Samples and an Application to Stochastic Geometry. COLT 1992: 172-179 - 1991
- [j18]Dimitri P. Bertsekas, John N. Tsitsiklis:
Some aspects of parallel and distributed iterative algorithms - A survey, . Autom. 27(1): 3-21 (1991) - [j17]Samuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis:
On the Predictability of Coupled Automata: An Allegory about Chaos. Complex Syst. 5(5) (1991) - [j16]Dimitri P. Bertsekas, C. Özveren, George D. Stamoulis, Paul Tseng, John N. Tsitsiklis:
Optimal Communication Algorithms for Hypercubes. J. Parallel Distributed Comput. 11(4): 263-275 (1991) - [j15]Dimitri P. Bertsekas, John N. Tsitsiklis:
An Analysis of Stochastic Shortest Path Problems. Math. Oper. Res. 16(3): 580-595 (1991) - [j14]Zhi-Quan Luo, John N. Tsitsiklis:
On the Communication Complexity of Solving a Polynomial Equation. SIAM J. Comput. 20(5): 936-950 (1991) - [j13]Nicholas Pippenger, George D. Stamoulis, John N. Tsitsiklis:
On a lower bound for the redundancy of reliable networks with noisy gates. IEEE Trans. Inf. Theory 37(3): 639-643 (1991) - [c4]George D. Stamoulis, John N. Tsitsiklis:
The Efficiency of Greedy Routing in Hypercubes and Butterflies. SPAA 1991: 248-259 - 1990
- [c3]Zhi-Quan Luo, John N. Tsitsiklis:
Communication Complexity of Algebraic Computation (Extended Abstract). FOCS 1990: 758-765 - [c2]Samuel R. Buss, Christos H. Papadimitriou, John N. Tsitsiklis:
On the Predictability of Coupled Automata: An Allegory about Chaos. FOCS 1990: 788-793
1980 – 1989
- 1989
- [b2]Dimitri P. Bertsekas, John N. Tsitsiklis:
Parallel and distributed computation. Prentice Hall 1989, ISBN 978-0-13-648759-3, pp. I-XIX, 1-715 - [j12]John N. Tsitsiklis:
On the Use of Random Numbers in Asynchronous Simulation via Rollback. Inf. Process. Lett. 31(3): 139-144 (1989) - [j11]Chef-Seng Chow, John N. Tsitsiklis:
The complexity of dynamic programming. J. Complex. 5(4): 466-488 (1989) - [j10]John N. Tsitsiklis:
On the control of discrete-event dynamical systems. Math. Control. Signals Syst. 2(2): 95-107 (1989) - [j9]John N. Tsitsiklis:
Markov Chains with Rare Transitions and Simulated Annealing. Math. Oper. Res. 14(1): 70-90 (1989) - [c1]Dimitri P. Bertsekas, John N. Tsitsiklis:
Convergence rate and termination of asynchronous iterative algorithms. ICS 1989: 461-470 - 1988
- [j8]John N. Tsitsiklis:
Decentralized detection by a large number of sensors. Math. Control. Signals Syst. 1(2): 167-182 (1988) - 1987
- [j7]John N. Tsitsiklis, Zhi-Quan Luo:
Communication complexity of convex optimization. J. Complex. 3(3): 231-243 (1987) - [j6]Christos H. Papadimitriou, John N. Tsitsiklis:
The Complexity of Markov Decision Processes. Math. Oper. Res. 12(3): 441-450 (1987) - [j5]John N. Tsitsiklis:
On the Stability of Asynchronous Iterative Processes. Math. Syst. Theory 20(2-3): 137-153 (1987) - [j4]Christos H. Papadimitriou, John N. Tsitsiklis:
On Stochastic Scheduling with In-Tree Precedence Constraints. SIAM J. Comput. 16(1): 1-6 (1987) - 1986
- [j3]John N. Tsitsiklis, Christos H. Papadimitriou, Pierre A. Humblet:
The performance of a precedence-based queuing discipline. J. ACM 33(3): 593-602 (1986) - 1985
- [j2]Bernard C. Levy, John N. Tsitsiklis:
A fast algorithm for linear estimation of two- dimensional isotropic random fields. IEEE Trans. Inf. Theory 31(5): 635-644 (1985) - 1984
- [b1]John N. Tsitsiklis:
Problems in decentralized decision making and computation. Massachusetts Institute of Technology, Cambridge, MA, USA, 1984 - 1982
- [j1]Christos H. Papadimitriou, John N. Tsitsiklis:
On the Complexity of Designing Distributed Protocols. Inf. Control. 53(3): 211-218 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-02-07 23:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
