Quantization games on networks

Ankur Mani, Lav R. Varshney, Alex Pentland

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

1 Scopus citations


We consider a network quantizer design setting where agents must balance fidelity in representing their local source distributions against their ability to successfully communicate with other connected agents. By casting the problem as a network game, we show existence of Nash equilibrium quantizer designs. For any agent, under Nash equilibrium, the word representing a given partition region is the conditional expectation of the mixture of local and social source probability distributions within the region. Further, the network may converge to equilibrium through a distributed version of the Lloyd-Max algorithm. In contrast to traditional results in the evolution of language, we find several vocabularies may coexist in the Nash equilibrium, with each individual having exactly one of these vocabularies. The overlap between vocabularies is high for individuals that communicate frequently and have similar local sources. Finally, we argue error in translation along a chain of communication does not grow if and only if the chain consists of agents with shared vocabulary.

Original languageEnglish (US)
Title of host publicationProceedings - DCC 2013
Subtitle of host publication2013 Data Compression Conference
Number of pages10
StatePublished - Aug 8 2013
Event2013 Data Compression Conference, DCC 2013 - Snowbird, UT, United States
Duration: Mar 20 2013Mar 22 2013

Publication series

NameData Compression Conference Proceedings
ISSN (Print)1068-0314


Other2013 Data Compression Conference, DCC 2013
Country/TerritoryUnited States
CitySnowbird, UT


Dive into the research topics of 'Quantization games on networks'. Together they form a unique fingerprint.

Cite this