Strong coordination over a line when actions are Markovian

Badri N. Vellambi, Jörg Kliewer, Matthieu R. Bloch

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

We analyze the problem of strong coordination over a multi-hop line network when the actions to be generated by the nodes satisfy a Markov chain that is matched to the network topology. We devise and prove the optimality of two schemes that cover the portions of the capacity region corresponding to unlimited or no common randomness shared by all nodes.

Original languageEnglish (US)
Title of host publication2016 50th Annual Conference on Information Systems and Sciences, CISS 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages412-417
Number of pages6
ISBN (Electronic)9781467394574
DOIs
StatePublished - Apr 26 2016
Event50th Annual Conference on Information Systems and Sciences, CISS 2016 - Princeton, United States
Duration: Mar 16 2016Mar 18 2016

Publication series

Name2016 50th Annual Conference on Information Systems and Sciences, CISS 2016

Other

Other50th Annual Conference on Information Systems and Sciences, CISS 2016
CountryUnited States
CityPrinceton
Period3/16/163/18/16

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Information Systems

Keywords

  • Channel resolvability
  • Channel synthesis
  • Line network
  • Strong coordination

Fingerprint Dive into the research topics of 'Strong coordination over a line when actions are Markovian'. Together they form a unique fingerprint.

Cite this