• Publications
  • Influence
A New Approach to Linear Filtering and Prediction Problems
The clssical filleting and prediclion problem is re-examined using the Bode-Shannon representation of random processes and the ?stat-tran-sition? method of analysis of dynamic systems. New resultExpand
  • 16,153
  • 1468
Dynamic Noncooperative Game Theory
Preface to the classics edition Preface to the second edition 1. Introduction and motivation Part I: 2. Noncooperative Finite Games: two-person zero-aum 3. Noncooperative finite games: N-PersonExpand
  • 4,041
  • 308
H/sup /spl infin//-0ptimal Control and Related Minimax Design Problems: A Dynamic Game Approach
TLDR
This is the second edition of a 1991 book with the same title, which, besides featuring a more streamlined presentation of the results included in the first edition, and at places under more refined conditions, also contains substantial new material, reflecting new developments in the field since 1991. Expand
  • 1,206
  • 85
Coalitional game theory for communication networks
TLDR
We provided a comprehensive overview of coalitional game theory, and its usage in wireless and communication networks through comprehensive theory and technical details as well as through practical examples drawn from both game theory and communication application. Expand
  • 839
  • 77
  • PDF
Analysis of Recursive Stochastic Algorithms
  • 460
  • 57
Quantized Consensus
TLDR
We study a discrete version of the distributed averaging problem that models averaging in a network with the finite capacity channel (and in this form has applications to distributed detection in sensor networks). Expand
  • 658
  • 40
  • PDF
TCP-Illinois: A loss- and delay-based congestion control algorithm for high-speed networks
TLDR
We introduce a new congestion control algorithm for high-speed networks, called TCP-Illinois, which achieves high throughput, allocates the network resource fairly, and is compatible with standard TCP. Expand
  • 168
  • 30
  • PDF
Fully Decentralized Multi-Agent Reinforcement Learning with Networked Agents
TLDR
We consider the problem of \emph{fully decentralized} multi-agent reinforcement learning (MARL), where the agents are located at the nodes of a time-varying communication network. Expand
  • 184
  • 28
  • PDF
...
1
2
3
4
5
...