Google
Google Scholar
Semantic Scholar
MS Academic
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
- 2020
[j123]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)- [j122]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
- [j121]John N. Tsitsiklis, Kuang Xu:
Delay-Predictability Trade-offs in Reaching a Secret Goal. Oper. Res. 66(2): 587-596 (2018) - [j120]Mihalis G. Markakis, Eytan 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) - [c52]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
- [j119]John N. Tsitsiklis, Kuang Xu:
Flexible Queueing Architectures. Oper. Res. 65(5): 1398-1413 (2017) - [j118]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
- [j117]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) - [j116]Mihalis G. Markakis, Eytan 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) - [c51]David Gamarnik, John N. Tsitsiklis, Martin Zubeldia:
Delay, Memory, and Messaging Tradeoffs in Distributed Service Systems. SIGMETRICS 2016: 1-12 - 2015
- [j115]John N. Tsitsiklis, Yunjian Xu:
Pricing of fluctuations in electricity markets. Eur. J. Oper. Res. 246(1): 199-208 (2015) - [j114]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) - [j113]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) - [c50]Julien M. Hendrickx, John N. Tsitsiklis:
Fundamental limitations for anonymous distributed systems with broadcast communications. Allerton 2015: 9-16 - [c49]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 - [c48]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
- [j112]Munther A. Dahleh, Alireza Tahbaz-Salehi, John N. Tsitsiklis, Spyros I. Zoumpoulis:
Coordination with local information. SIGMETRICS Perform. Evaluation Rev. 41(4): 29 (2014) - [j111]Krishna P. Jagannathan, Mihalis G. Markakis, Eytan 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) - [j110]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) - [j109]Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis:
Max-Weight Scheduling in Queueing Networks With Heavy-Tailed Traffic. IEEE/ACM Trans. Netw. 22(1): 257-270 (2014) - [c47]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
An efficient curing policy for epidemics on graphs. CDC 2014: 4447-4454 - [c46]Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis:
Delay stability of back-pressure policies in the presence of heavy-tailed traffic. ITA 2014: 1-10 - [c45]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
- [j108]Shie Mannor, John N. Tsitsiklis:
Algorithmic aspects of mean-variance optimization in Markov decision processes. Eur. J. Oper. Res. 231(3): 645-653 (2013) - [j107]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) - [j106]John N. Tsitsiklis, Yunjian Xu:
Profit loss in Cournot oligopolies. Oper. Res. Lett. 41(4): 415-420 (2013) - [j105]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) - [j104]Alex Olshevsky, John N. Tsitsiklis:
Degree Fluctuations and the Convergence Time of Consensus Algorithms. IEEE Trans. Autom. Control. 58(10): 2626-2631 (2013) - [j103]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
On Learning With Finite Memory. IEEE Trans. Inf. Theory 59(10): 6859-6872 (2013) - [c44]Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis:
Delay analysis of the Max-Weight policy under heavy-tailed traffic via fluid approximations. Allerton 2013: 436-444 - [c43]John N. Tsitsiklis, Kuang Xu:
Queueing system topologies with limited flexibility. SIGMETRICS 2013: 167-178 - 2012
- [j102]Krishna P. Jagannathan, Mihalis G. Markakis, Eytan 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) - [c42]John N. Tsitsiklis, Yunjian Xu:
Pricing of fluctuations in electricity markets. CDC 2012: 457-464 - [c41]Kimon Drakopoulos, Asuman E. Ozdaglar, John N. Tsitsiklis:
Conditions for learning in generalized tandem networks. CDC 2012: 7437-7444 - [c40]John N. Tsitsiklis, Yunjian Xu:
Efficiency Loss in a Cournot Oligopoly with Convex Market Demand. GAMENETS 2012: 63-76 - [c39]Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis:
Max-weight scheduling in networks with heavy-tailed traffic. INFOCOM 2012: 2318-2326 - [i15]Mihalis G. Markakis, Eytan 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
- [j101]Ramesh Johari, John N. Tsitsiklis:
Parameterized Supply Function Bidding: Equilibrium and Efficiency. Oper. Res. 59(5): 1079-1089 (2011) - [j100]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) - [j99]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) - [j98]Alexander Olshevsky, John N. Tsitsiklis:
Convergence Speed in Distributed Consensus and Averaging. SIAM Rev. 53(4): 747-772 (2011) - [j97]Julien M. Hendrickx, Alexander Olshevsky, John N. Tsitsiklis:
Distributed Anonymous Discrete Function Computation. IEEE Trans. Autom. Control. 56(10): 2276-2289 (2011) - [j96]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) - [j95]Devavrat Shah, David N. C. Tse, John N. Tsitsiklis:
Hardness of Low Delay Network Scheduling. IEEE Trans. Inf. Theory 57(12): 7810-7817 (2011) - [j94]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) - [c38]Julien M. Hendrickx, John N. Tsitsiklis:
A new condition for convergence in continuous-time consensus seeking systems. CDC-ECE 2011: 5070-5075 - [c37]Alexander Olshevsky, John N. Tsitsiklis:
Degree fluctuations and the convergence time of consensus algorithms. CDC-ECE 2011: 6602-6607 - [c36]Wee-Peng Tay, John N. Tsitsiklis:
Error exponents for decentralized detection in feedback architectures. ICASSP 2011: 2496-2499 - [c35]Shie Mannor, John N. Tsitsiklis:
Mean-Variance Optimization in Markov Decision Processes. ICML 2011: 177-184 - [c34]Krishna P. Jagannathan, Mihalis G. Markakis, Eytan Modiano, John N. Tsitsiklis:
Queue length asymptotics for generalized max-weight scheduling in the presence of heavy-tailed traffic. INFOCOM 2011: 2318-2326 - [c33]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 Modiano, John N. Tsitsiklis:
Max-Weight Scheduling in Queueing Networks with Heavy-Tailed Traffic. CoRR abs/1108.0370 (2011) - 2010
- [j93]John N. Tsitsiklis:
Commentary - Perspectives on Stochastic Optimization Over Time. INFORMS J. Comput. 22(1): 18-19 (2010) - [j92]Paat Rusmevichientong, John N. Tsitsiklis:
Linearly Parameterized Bandits. Math. Oper. Res. 35(2): 395-411 (2010) - [j91]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) - [c32]Alexander Olshevsky, John N. Tsitsiklis:
A lower bound for distributed averaging algorithms on the line graph. CDC 2010: 4523-4528 - [c31]Vincent D. Blondel, Julien M. Hendrickx, John N. Tsitsiklis:
Opinion dynamics for agents with opinion-dependent connections. CDC 2010: 6626-6632 - [c30]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 - [c29]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 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
- [j90]Shie Mannor, John N. Tsitsiklis:
Approachability in repeated games: Computational aspects and a Stackelberg variant. Games Econ. Behav. 66(1): 315-325 (2009) - [j89]Ramesh Johari, John N. Tsitsiklis:
Efficiency of Scalar-Parameterized Mechanisms. Oper. Res. 57(4): 823-839 (2009) - [j88]Shie Mannor, John N. Tsitsiklis, Jia Yuan Yu:
Online Learning with Sample Path Constraints. J. Mach. Learn. Res. 10: 569-590 (2009) - [j87]Alexander Olshevsky, John N. Tsitsiklis:
Convergence Speed in Distributed Consensus and Averaging. SIAM J. Control. Optim. 48(1): 33-55 (2009) - [j86]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) - [j85]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) - [j84]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) - [j83]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) - [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
- [j82]Alp Muharremoglu, John N. Tsitsiklis:
A Single-Unit Decomposition Approach to Multiechelon Inventory Systems. Oper. Res. 56(5): 1089-1103 (2008) - [j81]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) - [j80]Alexander Olshevsky, John N. Tsitsiklis:
On the Nonexistence of Quadratic Lyapunov Functions for Consensus Algorithms. IEEE Trans. Autom. Control. 53(11): 2642-2645 (2008) - [j79]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) - [j78]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) - [j77]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) - [c28]Angelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis:
Distributed subgradient methods and quantization effects. CDC 2008: 4177-4184 - [c27]Angelia Nedic, Alexander Olshevsky, Asuman E. Ozdaglar, John N. Tsitsiklis:
On distributed averaging algorithms and quantization effects. CDC 2008: 4825-4830 - [c26]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
- [j76]Shie Mannor, Duncan Simester, Peng Sun, John N. Tsitsiklis:
Bias and Variance Approximation in Value Function Estimates. Manag. Sci. 53(2): 308-322 (2007) - [j75]Jay Sethuraman, John N. Tsitsiklis:
Stochastic Search in a Forest Revisited. Math. Oper. Res. 32(3): 589-593 (2007) - [j74]John N. Tsitsiklis:
NP-Hardness of checking the unichain condition in average cost MDPs. Oper. Res. Lett. 35(3): 319-323 (2007) - [j73]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) - [j72]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) - [j71]Anand Ganti, Eytan Modiano, John N. Tsitsiklis:
Optimal Transmission Scheduling in Symmetric Communication Models With Intermittent Connectivity. IEEE Trans. Inf. Theory 53(3): 998-1008 (2007) - [j70]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) - [c25]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
Bayesian Detection in Bounded Height Tree Networks. DCC 2007: 243-252 - [c24]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 - [c23]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
Detection in Dense Wireless Sensor Networks. WCNC 2007: 3483-3488 - 2006
- [j69]Ramesh Johari, Shie Mannor, John N. Tsitsiklis:
A contract-based model for directed network formation. Games Econ. Behav. 56(2): 201-224 (2006) - [j68]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) - [j67]Duncan Simester, Peng Sun, John N. Tsitsiklis:
Dynamic Catalog Mailing Policies. Manag. Sci. 52(5): 683-696 (2006) - [j66]Alvin Fu, Eytan 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) - [c22]Alex Olshevsky, John N. Tsitsiklis:
Convergence Rates in Distributed Consensus and Averaging. CDC 2006: 3387-3392 - [c21]Shie Mannor, John N. Tsitsiklis:
Online Learning with Constraints. COLT 2006: 529-543 - [c20]Wee-Peng Tay, John N. Tsitsiklis, Moe Z. Win:
Asymptotically Optimal Distributed Censoring. ISIT 2006: 625-629 - 2005
- [j65]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) - [j64]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) - [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
- [j63]Shie Mannor, John N. Tsitsiklis:
The Sample Complexity of Exploration in the Multi-Armed Bandit Problem. J. Mach. Learn. Res. 5: 623-648 (2004) - [j62]Ramesh Johari, John N. Tsitsiklis:
Efficiency Loss in a Network Resource Allocation Game. Math. Oper. Res. 29(3): 407-435 (2004) - [c19]Shie Mannor, Duncan Simester, Peng Sun, John N. Tsitsiklis:
Bias and variance in value function estimation. ICML 2004 - 2003
- [j61]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) - [j60]Vijay R. Konda, John N. Tsitsiklis:
Linear stochastic approximation driven by slowly varying Markov chains. Syst. Control. Lett. 50(2): 95-102 (2003) - [j59]Vijay R. Konda, John N. Tsitsiklis:
OnActor-Critic Algorithms. SIAM J. Control. Optim. 42(4): 1143-1166 (2003) - [j58]Alvin Fu, Eytan Modiano, John N. Tsitsiklis:
Optimal energy allocation and admission control for communications satellites. IEEE/ACM Trans. Netw. 11(3): 488-500 (2003) - [c18]Shie Mannor, John N. Tsitsiklis:
Lower Bounds on the Sample Complexity of Exploration in the Multi-armed Bandit Problem. COLT 2003: 418-432 - [c17]Alvin Fu, Eytan Modiano, John N. Tsitsiklis:
Optimal Energy Allocation for Delay-Constrained Data Transmission over a Time-Varying Channel. INFOCOM 2003: 1095-1105 - 2002
- [j57]John N. Tsitsiklis:
On the Convergence of Optimistic Policy Iteration. J. Mach. Learn. Res. 3: 59-72 (2002) - [j56]John N. Tsitsiklis, Benjamin Van Roy:
On Average Versus Discounted Reward Temporal-Difference Learning. Mach. Learn. 49(2-3): 179-191 (2002) - [c16]Alvin Fu, Eytan Modiano, John N. Tsitsiklis:
Optimal Energy Allocation and Admission Control for Communications Satellites. INFOCOM 2002: 648-656 - 2001
- [j55]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) - [j54]Peter Marbach, John N. Tsitsiklis:
Simulation-based optimization of Markov reward processes. IEEE Trans. Autom. Control. 46(2): 191-209 (2001) - [j53]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) - [j52]