Data Fusion Trees for Detection: Does Architecture Matter? (2008)
Tay, Wee Peng, Tsitsiklis, John, Win, Moe
We consider the problem of decentralized detection in a network consisting of a large number of nodes arranged as a tree of bounded height, under the assumption of conditionally independent,...
On Distributed Averaging Algorithms and Quantization Effects (2007)
Nedić, Angelia, Olshevsky, Alex, Ozdaglar, Asuman, Tsitsiklis, John
We consider distributed iterative algorithms for the averaging problem over time-varying topologies. Our focus is on the convergence time of such algorithms when complete (unquantized) information is...
Alvin Fu, Eytan Modiano, John Tsitsiklis
Abstract—We address the issue of optimal energy allocation and admission control for communications satellites in earth orbit. Such satellites receive requests for transmission as they orbit the...
Alvin Fu, Eytan Modiano, John Tsitsiklis
Abstract — We seek to optimize the performance of a resource-constrained satellite transmitting data over a fading channel. We first examine methods to maximize the data throughput when a satellite...
Fisher III., John W., Cetin, Mujdat, Jaakkola, Tommi, Tsitsiklis, John, Verdu, Sergio, Kulkarni, Sanjeev, ...
This final report summarizes the research and activities under the ODDR&E MURI on Data Fusion in Large Arrays of Microsensors. The report reviews the intellectual themes and research concentration...
Network resource allocation and a congestion game (2003)
Ramesh Johari, John Tsitsiklis
We explore the properties of a congestion game where users of a congested resource anticipate the effect of their actions on the price of the resource. When users are sharing a single resource, we...
Routing and peering in a competitive internet (2003)
Ramesh Johari, John Tsitsiklis
Today’s Internet is a loose federation of independent network providers, each acting in their own self interest. In this paper, we consider some implications of this economic reality. Specifically,...
Network resource allocation and a congestion game (2003)
Ramesh Johari, John Tsitsiklis
We explore the properties of a congestion game where users of a congested resource anticipate the effect of their actions on the price of the resource. When users are sharing a single resource, we...
Optimal Energy Allocation for Delay-Constrained Data Transmission over a Time-Varying Channel (2003)
Alvin Fu, Eytan Modiano, John Tsitsiklis
We seek to maximize the data throughput of an energy and time constrained transmitter sending data over a fading channel. The transmitter has a fixed amount of energy and a limited amount of time to...
Optimal energy allocation and admission control for communications satellites (2003)
Alvin Fu, Eytan Modiano, John Tsitsiklis
Abstract—We address the issue of optimal energy allocation and admission control for communications satellites in earth orbit. These satellites receive requests for transmission as they orbit the...
On the Complexity of Designing Distributed Protocols, (2002)
Papadimitriou,Christos H., Tsitsiklis,John
We study the complexity of two problems of distributed computation and decision-making. We show that deciding whether two distant agents can arrive at compatible decisions without any communication...
Transmission scheduling over a fading channel with energy and deadline constraints (2002)
Alvin Fu, Eytan Modiano, John Tsitsiklis
Abstract — We seek to maximize the data throughput of a power, energy, and time constrained transmitter sending data over a fading channel. The transmitter has a fixed amount of energy, a maximum...
Optimal Energy Allocation and Admission Control for Communications Satellites (2002)
Alvin Fu, Eytan Modiano, John Tsitsiklis
We address the issue of optimal energy allocation and admission control for communications satellites in earth orbit. These satellites receive requests for transmission as they orbit the earth, but...
Optimal Energy Allocation and Admission Control for Communications Satellites (2002)
Alvin Fu, Eytan Modiano, John Tsitsiklis
We address the issue of optimal energy allocation and admission control for communications satellites in earth orbit. These satellites receive requests for transmission as they orbit the earth, but...
Actor-Critic Algorithms (2000)
We propose and analyze a class of actor-critic algorithms for simulation-based optimization of a Markov decision process over a parameterized family of randomized stationary policies. These are...
Deciding Stability and Mortality of Piecewise Ane Dynamical Systems (1999)
Ecole Normale, Superieure Lyon, Unite Mixte, Vincent Blondel Olivier, Olivier Bournez, ...
We show that several global properties (attractivity, global asymptotic stability and mortality) of discrete time dynamical systems dened by iteration of piecewise-ane maps are undecidable. Such...
Deciding Stability and Mortality of Piecewise Affine Dynamical Systems (1999)
Ecole Normale, Superieure Lyon, Unite Mixte, Vincent Blondel, Olivier Bournez, ...
We show that several global properties (attractivity, global asymptotic stability and mortality) of discrete time dynamical systems defined by iteration of piecewise-affine maps are undecidable. Such...
On the Predictability of Coupled Automata: An Allegory About Chaos (1991)
Sam Buss, Christos H. Papadimitriou, John Tsitsiklis
Abstract We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The division...
On the Predictability of Coupled Automata: An Allegory About Chaos (1991)
Sam Buss, Christos H. Papadimitriou, John Tsitsiklis
Abstract We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The division...
On the Predictability of Coupled Automata: An Allegory About Chaos (1991)
Sam Buss, Christos H. Papadimitriou, John Tsitsiklis
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The division pertains...
On The Predictability Of Coupled Automata: (1991)
An Allegory About, Sam Buss, Christos H. Papadimitriou, John Tsitsiklis
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The division pertains...
On the Predictability of Coupled Automata: An Allegory About Chaos (1991)
Sam Buss, Christos H. Papadimitriou, John Tsitsiklis
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The division pertains...
On the Predictability of Coupled Automata: An Allegory About Chaos (1991)
Sam Buss, Christos H. Papadimitriou, John Tsitsiklis
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The division pertains...
On the Predictability of Coupled Automata: An Allegory About Chaos (1991)
Sam Buss, Christos H. Papadimitriou, John Tsitsiklis
We show a sharp dichotomy between systems of identical automata with a symmetric global control whose behavior is easy to predict, and those whose behavior is hard to predict. The division pertains...
A simple criterion for structurally fixed modes (1984)
Christos H. Papadimitriou, John Tsitsiklis
We present a simple characterization of the maximum possible rank of the product of several real matrices, when certain entries of the matrices are constrained to be zero. Our result relates this...
On the complexity of designing distributed protocols (1982)
Christos H. Papadimitriou, John Tsitsiklis
The complexity of two problems of distributed computation and decision-making is studied. It is shown that deciding whether two distant agents can arrive at compatible decisions without any...
*Paper submitted to Information and Control (1982)
Christos H. Papadimitriou, John Tsitsiklis, Onon T Nplexi, Christos H. Ipapadimitriou, John Tsitsiklis
We study the complexity of two problems of distributed computation and decision-making. We show that deciding ihether two distant agents can arrive at compatible decisions without any communication...