{"title":"Two-Agent Approximate Agreement from an Epistemic Logic Perspective","authors":"J. Armenta-Segura, J. Ledent, S. Rajsbaum","doi":"10.13053/cys-26-2-4234","DOIUrl":null,"url":null,"abstract":"We investigate the two agents approximate agreement problem in a dynamic network in which topology may change unpredictably, and where consensus is not solvable. It is known that the number of rounds necessary and sufficient to guarantee that the two agents output values 1 /k 3 away from each other is k . We distil ideas from previous papers to provide a self-contained, elementary introduction, that explains this result from the epistemic logic perspective.","PeriodicalId":333706,"journal":{"name":"Computación Y Sistemas","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computación Y Sistemas","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.13053/cys-26-2-4234","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
We investigate the two agents approximate agreement problem in a dynamic network in which topology may change unpredictably, and where consensus is not solvable. It is known that the number of rounds necessary and sufficient to guarantee that the two agents output values 1 /k 3 away from each other is k . We distil ideas from previous papers to provide a self-contained, elementary introduction, that explains this result from the epistemic logic perspective.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
