{"title":"User-preference-aware Private-preserving Average Consensus","authors":"Zhenping Chen, Lin X. Cai","doi":"10.1109/PACRIM47961.2019.8985093","DOIUrl":null,"url":null,"abstract":"Privacy-preserving average consensus is important for multi-agent systems and has been extensively studied. Considering the more practical scenario that different users may have different privacy preferences, there exists a tradeoff between the convergence time and the data privacy protection. In this paper, we design the added noises with the optimal variances considering the heterogeneous user preferences. We develop a novel definition on the convergence time for ensuring (α, γ)- accuracy, which depicts how fast the consensus protocol can converge to the average with a bounded deviation, α, with a probability no smaller than 1 – γ. We obtain the analytical expression for the upper bound of the convergence time. We design the utility of each agent which is inversely proportional to the privacy preference, such that some user may prefer a lower privacy for a higher utility. With the introduction of the reward- incentive mechanism, we then formulate optimization problems to optimize the distribution and the variance of the added noises. Simulations were conducted to verify the analysis.","PeriodicalId":152556,"journal":{"name":"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing (PACRIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PACRIM47961.2019.8985093","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Privacy-preserving average consensus is important for multi-agent systems and has been extensively studied. Considering the more practical scenario that different users may have different privacy preferences, there exists a tradeoff between the convergence time and the data privacy protection. In this paper, we design the added noises with the optimal variances considering the heterogeneous user preferences. We develop a novel definition on the convergence time for ensuring (α, γ)- accuracy, which depicts how fast the consensus protocol can converge to the average with a bounded deviation, α, with a probability no smaller than 1 – γ. We obtain the analytical expression for the upper bound of the convergence time. We design the utility of each agent which is inversely proportional to the privacy preference, such that some user may prefer a lower privacy for a higher utility. With the introduction of the reward- incentive mechanism, we then formulate optimization problems to optimize the distribution and the variance of the added noises. Simulations were conducted to verify the analysis.