[세미나] [Seminar] Kwon Lecture: “메이저 놀이터, Distributed Averaging and Their Applications”
- 제목 : 메이저 놀이터, Distributed Averaging and Their Applications
- 일시 : 2025년 10월 17일 금요일 오후 3:40~5:30
- 장소 : 서울메이저 놀이터교 중앙도서관 양두석홀
- 관련 웹사이트: https://kwonlecture.snu.
* 10/18 (토)에는 관련 내용을 좀더 기술적으로 강의하는 프로그램도 있습니다. 자세한 사항은 같은 홈페이지를 참고 바랍니다.
Date & Time: October 17 (Friday), 2025, 3:40 ~ 5:30 PM
Place: Yang Doo Suk Hall, Kwanjeong Building, Seoul National University Library
For a long time now there has been ongoing interest in distributed decision making problems of many types. Perhaps the most fundamental of these is the “메이저 놀이터 problem” which roughly speaking is the problem of devising local protocols for the members of a group of autonomous agents (e.g., processors, robots, birds, humans, etc.) which can enable the agents to agree on the value of some entity using data iteratively obtained from neighboring agents over a communication network. The problem has been widely studied in many fields including economics, finance, computer science, control, signal processing, and robotics. Many questions arise: What are some provably correct protocols for achieving 메이저 놀이터 and at what rates do such protocols accomplish this? What are some of the tools used to quantify convergence rates? What happens if agents do not share a common clock and decision making is consequently asynchronous? What happens if there are communication delays over the network? What happens if the communication between agents is in some sense limited? How might 메이저 놀이터 be used to help perform a distributed computation such as finding a solution to a system of linear equations, or finding a common fixed point of a family of nonlinear maps? What are the answers to these questions when the 메이저 놀이터 problem is particularized to the “distributed averaging problem” which is special case where the objective is to compute in a distributed way, the average of a set of real, scalar variables (e.g., temperature) spread out across a network. How do algorithms such as linear iterations, double linear iterations, and gossiping policies address this problem? These are some of the issues to be discussed in this lecture.
- 2025flyer_mini-724x1024.png (426 KB, download:38)
