000134032 001__ 134032
000134032 005__ 20190331192657.0
000134032 02470 $$2ISI$$a000268919201455
000134032 037__ $$aCONF
000134032 245__ $$aInterval consensus: from quantized gossip to voting
000134032 269__ $$a2009
000134032 260__ $$c2009
000134032 336__ $$aConference Papers
000134032 520__ $$aWe design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Instead, our algorithm reaches consensus on the quantized interval that contains the average. We prove that this consensus in reached in finite time almost surely. As a byproduct of this convergence result, we show that the majority voting problem is solvable with only 2 bits of memory per agent.
000134032 6531_ $$aConsensus
000134032 6531_ $$aquantization
000134032 6531_ $$agossip
000134032 6531_ $$avoting
000134032 700__ $$0240372$$g166121$$aBenezit, Florence
000134032 700__ $$0240373$$g103925$$aThiran, Patrick
000134032 700__ $$aVetterli, Martin$$g107537$$0240184
000134032 7112_ $$dApril 19-24, 2009$$cTaipei, Taiwan$$aICASSP 2009
000134032 773__ $$tIEEE, ICASSP 2009$$q3661-3664
000134032 8564_ $$uhttp://www.icassp09.com/default.asp$$zURL
000134032 8564_ $$uhttps://infoscience.epfl.ch/record/134032/files/04960420.pdf$$zn/a$$s264298$$yn/a
000134032 909C0 $$xU10434$$0252056$$pLCAV
000134032 909C0 $$pLCA3$$xU10431$$0252454
000134032 909CO $$qGLOBAL_SET$$pconf$$pIC$$ooai:infoscience.tind.io:134032
000134032 917Z8 $$x222073
000134032 937__ $$aLCAV-CONF-2009-003
000134032 973__ $$rREVIEWED$$sPUBLISHED$$aEPFL
000134032 980__ $$aCONF