# Coordination in state-dependent distributed networks: The two-agent case

@article{Larrousse2015CoordinationIS, title={Coordination in state-dependent distributed networks: The two-agent case}, author={Benjamin Larrousse and Samson Lasaulce and Mich{\`e}le A. Wigger}, journal={2015 IEEE International Symposium on Information Theory (ISIT)}, year={2015}, pages={979-983} }

This paper addresses a coordination problem between two agents (Agents 1 and 2) in the presence of a noisy communication channel which depends on an external system state {x0,t}. The channel takes as inputs both agents' actions, {x1,t} and {x2,t} and produces outputs that are observed strictly causally at Agent 2 but not at Agent 1. The system state is available either causally or non-causally at Agent 1 but unknown at Agent 2. Necessary and sufficient conditions on a joint distribution Q̅(x0… Expand

#### Figures and Topics from this paper

#### 11 Citations

Coordinating partially-informed agents over state-dependent networks

- Computer Science
- 2015 IEEE Information Theory Workshop (ITW)
- 2015

This work considers a multi-agent scenario with K ≥ 2 agents that have partial information about some random nature state, and that take actions in a repeated manner to characterize the set of asymptotically implementable distributions on the agents' actions and the nature state. Expand

Information Constraints in Multiple Agent Problems with I.I.D. States

- Computer Science
- 2018

This chapter describes several recent results on the problem of coordination among agents when they have partial information about a state which affects their utility, payoff, or reward function and exploits Shannon theory to characterize the achievable long-term utility region. Expand

Joint Empirical Coordination of Source and Channel

- Computer Science
- IEEE Trans. Inf. Theory
- 2017

This article studies a point-to-point scenario in which the encoder and the decoder implement decentralized policies that are coordinated, and shows that the compression and the transmission of information are particular cases of the empirical coordination. Expand

Joint Empirical Coordination of Source and Channel

- Mathematics
- IEEE Transactions on Information Theory
- 2017

In a decentralized and self-configuring network, the communication devices are considered as autonomous decision makers that sense their environment and that implement optimal transmission schemes.… Expand

Empirical Coordination for Joint Source-Channel Coding

- Computer Science, Mathematics
- ArXiv
- 2014

The optimal trade-offs between transmission and coordination are determined by maximizing a utility function over the set of achievable probability distribution for a point-to-point source-channel model with strictly-causal and causal decoding. Expand

Characterization of the limit performance in non-cooperative games with imperfect observation : application to 5G. (Caractérisation des performances limites des jeux non-coopératifs avec observation imparfaite : application à la téléphonie mobile 5G)

- Computer Science, Philosophy
- 2017

This thesis shows that opportunistic interference alignment can be implemented by only assuming interference-plus-noise covariance feedback at the secondary transmitter, and generalizes the problem of quantization, assuming that the quantizer and de-quantizer are designed to maximize a general utility function instead of the conventional distortion function. Expand

Strong coordination over multi-hop line networks

- Computer Science, Mathematics
- 2015 IEEE Information Theory Workshop - Fall (ITW)
- 2015

A characterization of the capacity region when the initiating node possesses unlimited local randomness and intermediate nodes operate under a functional regime is provided. Expand

A framework for computing power consumption scheduling functions under uncertainty

- Engineering, Computer Science
- 2015 IEEE International Conference on Smart Grid Communications (SmartGridComm)
- 2015

This work provides a full characterization of the set of feasible payoffs which can be reached by a set of appliances having partial information and exploits the principal component analysis to approximate the exogenous load and show its full relevance. Expand

The Rate-and-State Capacity with Feedback

- Computer Science
- IEEE Transactions on Information Theory
- 2018

For the noncausal case, bounds on the capacity are provided and a condition under which the bounds coincide is identified, which is shown to increase this capacity even for channels that are memoryless with memoryless states. Expand

Strong Coordination Over Multi-Hop Line Networks Using Channel Resolvability Codebooks

- Computer Science
- IEEE Transactions on Information Theory
- 2018

This work presents an achievable coding scheme built using multiple layers of channel resolvability codes, and establishes several settings in which this scheme offers the best possible trade-offs among network resources. Expand

#### References

SHOWING 1-10 OF 25 REFERENCES

Coordination using implicit communication

- Computer Science, Mathematics
- 2011 IEEE Information Theory Workshop
- 2011

A basic noise-free signaling scenario where coordination and communication are naturally merged sheds light on the embedding of digital information in analog signals, a concept that is exploited in digital watermarking, steganography, cooperative communication, and strategic play in team games such as bridge. Expand

Empirical Coordination for Joint Source-Channel Coding

- Computer Science, Mathematics
- ArXiv
- 2014

The optimal trade-offs between transmission and coordination are determined by maximizing a utility function over the set of achievable probability distribution for a point-to-point source-channel model with strictly-causal and causal decoding. Expand

Coded power control: Performance analysis

- Computer Science, Mathematics
- 2013 IEEE International Symposium on Information Theory
- 2013

This paper derives, as a first step towards many extensions of the present work, a general result which not only concerns power control (PC) but also any scenario involving two decision-makers (DMs) which communicate through their actions and have the following information and decision structures. Expand

On Successive Refinement With Causal Side Information at the Decoders

- Mathematics, Computer Science
- IEEE Transactions on Information Theory
- 2008

First, a single-letter characterization of achievable rates is derived for a pure source-coding problem with successive refinement and causal SI at the decoders, and finally, it is shown that the binary-symmetric source is successively refinable. Expand

Network Information Theory

- Computer Science
- 2001

A system with many senders and receivers contains many new elements in the communication problem: interference, cooperation and feedback. These are the issues that are the domain of network… Expand

Causal State Communication

- Computer Science, Mathematics
- IEEE Transactions on Information Theory
- 2013

It is shown that any optimal tradeoff pair can be achieved via rate-splitting and coding theorems are extended optimally to the case of causal channel state information at the encoder using the Shannon strategy. Expand

Optimal use of communication resources

- Economics, Mathematics
- 2006

We study a repeated game with asymmetric information about a dynamic state of nature. In the course of the game, the better-informed player can communicate some or all of his information to the… Expand

Handbook of Game Theory with Economic Applications

- Economics
- 1992

Preface (R.J. Aumann, S. Hart). Strategic equilibrium (E. van Damme). Foundations of strategic equilibrium (J. Hillas, E. Kohlberg). Incomplete information (R.J. Aumann, A. Heifetz). Non-zero-sum… Expand

Channel capacity and state estimation for state-dependent Gaussian channels

- Physics, Computer Science
- IEEE Transactions on Information Theory
- 2005

It is shown that any optimal (R, D) tradeoff pair can be achieved via a simple power-sharing technique, whereby the transmitter power is appropriately allocated between pure information transmission and state amplification. Expand

Network Information Theory

- Computer Science
- 2011

Key topics covered include successive cancellation and superposition coding, MIMO wireless communication, network coding, and cooperative relaying, and asynchronous and random access channels. Expand