Tsitsiklis, John - Laboratory for Information and Decision Systems & Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT)

• Math. Systems Theory 20, 137-153 (19871 Mathematical
• Coordinating a Constrained Channel with Linear Wholesale Price Contracts.
• MATHEMATICS OF OPERATIONS RESEARCH Vol. 29, No. 3, August 2004, pp. 407435
• IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS, VOL. CAS-29, NO. 6, JUNE 1982 C. W. Barnes, "Roundoff noise and overflow in normal digital filters,"
• Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. CONTROL OPTIM. c 2009 Society for Industrial and Applied Mathematics
• MATHEMATICS OF OPERATIONS RESEARCH Vol. 32, No. 3, August 2007, pp. 589593
• Distributed Subgradient Methods and Quantization Effects Angelia Nedic
• JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS: Vol 44, No. ,.SEPTEMBER 1984 Convexity and Characterization of Optimal Policies in
• IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 56, NO. 6, JUNE 2008 2535 On the Impact of Node Failures and Unreliable
• Journal of Machine Learning Research 10 (2009) 569-590 Submitted 7/08; Revised 1/09; Published 3/09 Online Learning with Sample Path Constraints
• SIAM J COMPUT g, 1987 Society for Industrialand Appihed Mithemanucs Vol 16,No I, Februar,198
• Parameterized Supply Function Bidding: Equilibrium and Efficiency
• Efficiency Loss in a Network Resource Allocation Game
• IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 46, NO. 2, FEBRUARY 2001 191 Simulation-Based Optimization of
• December 2, 2008 "Asynchronous Stochastic Approximation and Q-Learning "
• This research was supported by the NSF under grant DMI-9625489 and the AFOSR under grant F49620-95-1-0219. This paper was not
• Hardness of low delay network scheduling Devavrat Shah David N. C. Tse John N. Tsitsiklis
• Error Exponents for Decentralized Detection in Tree Networks
• A Game Theoretic View of Efficiency Loss in Resource Allocation
• Convergence of type-symmetric and cut-balanced consensus seeking systems
• arXiv:1012.1908v1[math.OC]9Dec2010 NP-hardness of Deciding Convexity of
• The Value of Feedback for Decentralized Detection in Large Sensor Networks
• Qualitative Properties of -Weighted Scheduling Policies Devavrat Shah
• IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 54, NO. 12, DECEMBER 2009 2787 A Structured Multiarmed Bandit
• 2586 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 54, NO. 11, NOVEMBER 2009 On Krause's Multi-Agent Consensus Model
• 4042 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 57, NO. 10, OCTOBER 2009 Bayesian Detection in Bounded Height Tree Networks
• 2642 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 53, NO. 11, DECEMBER 2008 Fig. 3. Example 2: optimal trajectories for , .
• IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 10, OCTOBER 2008 4767 On the Subexponential Decay of Detection Error
• IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 11, NOVEMBER 2007 4191 Asymptotic Performance of a Censoring
• Operations Research Letters 35 (2007) 319323 www.elsevier.com/locate/orl
• MANAGEMENT SCIENCE Vol. 53, No. 2, February 2007, pp. 308322
• Games and Economic Behavior 56 (2006) 201224 www.elsevier.com/locate/geb
• 992 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 24, NO. 5, MAY 2006 A Scalable Network Resource Allocation Mechanism
• 1712 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 50, NO. 11, NOVEMBER 2005 Efficiency Loss in a Network Resource Allocation
• MATHEMATICS OF OPERATIONS RESEARCH Vol. 30, No. 3, August 2005, pp. 545561
• ON ACTOR-CRITIC ALGORITHMS VIJAY R. KONDA AND JOHN N. TSITSIKLIS
• On Differentiability of Average Cost in Parameterized Markov Chains
• Machine Learning, 49, 179191, 2002 c 2002 Kluwer Academic Publishers. Manufactured in The Netherlands.
• 694 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 12, NO. 4, JULY 2001 Regression Methods for Pricing Complex
• 1840 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 44, NO. 10, OCTOBER 1999 Optimal Stopping of Markov Processes
• Math. Control SignalsSystems(1997)10:31-40 9 1997Springer-VerlagLondon Limited Mathematicsof Control,
• Machine Learning, 22, 59-94 (1996) 1996 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
• On the Average Communication Complexity of Asynchronous Distributed Algorithms
• Systems & Control Letters 20 (1993) 157-166 157 North-Holland
• Special Cases of Traveling Salesman and Repairman Problems with Time Windows*
• Complex Systems 5 (1991) 525-539 On the Predictability of Coupled Automata
• SIAM J COMPTr 1991 Society forindustnaland Applied Mathematics Vol 20, No 5,pp 936-950, October 1991 008
• SIAM J CONTROL AND OFTIMIZATION Vol 28, No. 3, pp. 678-710, May 1990
• JOURNAL OF COMPLEXITY 5,466-488 (1989) The Complexity of Dynamic Programming*,?
• Information Processing Letters 31(1989) 139-144 North-Holland
• JOURNAL OF COMPLEXITY 3, 231-243 (1987) Communication Complexity of Convex Optimization*
• IEEE TRANSACTIONS ON AUTOMATIC COhTROL, VOL. AC-32, NO. 11, NOVELMBER1987 ' 1017 CHANGE IN kth DEPARTURE TIME
• IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. AC-31. NO, 9, SEPTEMBER 1986 803 Distributed Asynchronous Deterministic and
• The Performance of a Precedence-Based Queuing Discipline
• 440 IEEE TRANSACTIONS ON AUTOMATIC CONTROL. VOL.AC-30. NO.5 , MAY 1985 On the Complexity of Decentralized Decision
• Systems & Control Letters 4 (1984) 333-337 North-Holland
• 690 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. AC-29,NO. 8, AUGUST 1984 H. Roesler, "Statistical analysis and evaluation of myoelectric sig-
• 42 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. AC-29,NO. I , JANUARY 1984 Convergenceand Asymptotic Agreement
• LIDS-P-1369 Reprinted from INFORMATIONANDCONTROL Vol. 53, No. 3. June 1982
• Routing and Peering in a Competitive Internet Ramesh Johari
• Dynamic Leadtime Management in Supply Chains Alp Muharremoglu
• A Neuro-Dynamic Programming Approach to Call Admission Control in Integrated Service
• A Neuro-Dynamic Programming Approach to Retailer Inventory Management1
• August 1986 LIDS-P-1616 LOWER BOUNDS ON THE TIME TO COMPUTE A SIMPLE
• December, 1981 LIDS-P-1170 INTEGRAL EQUATIONS AND RESOLVENTS
• November, 1982 LIDS-P-1155 LINEAR ESTIMATION OF STATIONARY STOCHASTIC PROCESSES,
• Math. Control Signals Systems (1988) 1: 167-182 Mathematics of Control,
• Math. Control Signals Systems(1997)10:381 9 1997Springer-VerlagLondon Limited Mathematicsof Control,
• Au/OmGnCG.Vol 27. No I. pp 3--21.1991 PrInted In Great Bnta,n
• 968 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 52, NO. 5, MAY 2007 Comments on "Coordination of Groups of Mobile
• 576 IEEE TRANSACTIONSON AUTOMATIC CONTROL, VOL. AC-31, NO. 6, JUNE 1986 [9] J. Delforge, "On local identifiability of linear systems," Math. Biosci., vol. 70,
• IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 18, NO. 2, FEBRUARY 2000 197 Call Admission Control and Routing in Integrated
• Journal of Economic Behavior & Organization 74 (2010) 104122 Contents lists available at ScienceDirect
• 1528 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 40, NO. 9, SEPTEMBER 1995 Efficient Algorithms for
• Information Processing Letters 46 (1993) 219-224 9 July 1993
• OPERATIONS RESEARCH doi 10.1287/opre.1080.0620ec
• MANAGEMENT SCIENCE doi 10.1287/mnsc.1060.0614ec
• Available online at www.sciencedirect.com Systems & Control Letters 50 (2003) 95102
• IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 54, NO. 9, SEPTEMBER 2008 4155 Data Fusion Trees for Detection
• JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING I1, 263-275 ( 1991 ) Optimal Communication Algorithms for Hypercubes*
• Adv. Appl. Prob. 22, 929-956 (1990) Printedin N. Ireland
• Journal of Machine Learning Research 3 (2002) 5972 Submitted 10/01; Published 7/02 On the Convergence of Optimistic Policy Iteration
• IEEE TRANSACTIONSON AUTOMATICCONTROL. VOL. AC-3I. NO. 4. APRIL 1986 325 Distributed Asynchronous Optimal Routing in Data
• On the Power of (even a little) Centralization in Distributed John N. Tsitsiklis *
• Distributed anonymous discrete function computation and Julien M. Hendrickx, Alex Olshevsky, and John N. Tsitsiklis
• MANAGEMENT SCIENCE Vol. 30. No. 10. October 1984
• Routing and Peering in a Competitive Internet Ramesh Johari (rjohari@mit.edu)
• 278 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 43, NO. 2, FEBRUARY 1998 [6] R. K. Yedavalli, "Improved measures of stability robustness for linear
• Appl. Math. Left. Vol. 2, No. 2, pp. 167-170, 1989 Printed in Great Britain. All rights reserved
• The Annals of Applied Probability 2001, Vol. 00, No. 0, 145
• MATHEMATICS OF OPERATIONS RESEARCH Vol. 35, No. 2, May 2010, pp. 395411
• Distributed anonymous function computation in information fusion and multiagent systems
• OPERATIONS RESEARCH doi 10.1287/opre.1080.0638ec
• OPERATIONS RESEARCH Vol. 57, No. 4, JulyAugust 2009, pp. 823839
• MANAGEMENT SCIENCE Vol. 52, No. 5, May 2006, pp. 683696
• GRADIENT CONVERGENCE IN GRADIENT METHODS WITH ERRORS
• arXiv:1104.2340v1[math.PR]12Apr2011 Submitted to the Annals of Applied Probability
• Journal of Computer and System Sciences 62, 442 462 (2001) The Stability of Saturated Linear Dynamical
• On the Communication Complexity of Distributed Algebraic Computation
• OPERATIONS RESEARCH LETTERS A NOTE ON STRATEGY ELIMINATION IN BIMATRIX GAMES
• 2506 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 54, NO. 11, NOVEMBER 2009 On Distributed Averaging Algorithms
• Decentralized Detection in Sensor Network Architectures with Feedback
• Efficiency Loss in Cournot Games Ramesh Johari (rjohari@mit.edu)
• OPERATIONS RESEARCH Vol. 56, No. 5, SeptemberOctober 2008, pp. 10891103
• Degree Fluctuations and the Convergence Time of Consensus Alex Olshevsky John N. Tsitsiklis
• Discrete Event Dynamic Systems: Theory and Applications, 13, 111148, 2003 # 2003 Kluwer Academic Publishers. Manufactured in The Netherlands.
• Games and Economic Behavior 66 (2009) 315325 www.elsevier.com/locate/geb
• The Annals of Applied Probability 2004, Vol. 14, No. 2, 796819
• IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. IT-X, NO. 5, SEPTEMBER 1985 635 A Fast Algorithm for Linear Estimation of
• On the Power of (even a little) Centralization in Distributed Processing *
• A lower bound for distributed averaging algorithms Alex Olshevsky, John N. Tsitsiklis
• CONTINUOUS-TIME AVERAGE-PRESERVING OPINION DYNAMICS WITH OPINION-DEPENDENT COMMUNICATIONS
• Convergence in Multiagent Coordination, Consensus, and Flocking Vincent D. Blondel, Julien M. Hendrickx, Alex Olshevsky, and John N. Tsitsiklis
• Journal of Machine Learning Research 5 (2004) 623-648 Submitted 1/04; Published 6/04 The Sample Complexity of Exploration in the
• Machine Learning, 16, 185-202 (1994) 1994 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
• Convergence in Multiagent Coordination, Consensus, and Flocking Vincent D. Blondel, Julien M. Hendrickx, Alex Olshevsky, and John N. Tsitsiklis
• Mean-Variance Optimization in Markov Decision Shie Mannor (Corresponding Author)
• A lower bound for distributed averaging algorithms on the line graph
• Mean-Variance Optimization in Markov Decision Processes Shie Mannor shie@ee.technion.ac.il
• ?????, VOL. ???, NO. ???, ??? 1 Distributed anonymous discrete function
• ON THE POWER OF (EVEN A LITTLE) RESOURCE By John N. Tsitsiklis and Kuang Xu
• A Dynamic Programming Approach to Adaptive Fractionation