Learning models in social networks
This thesis studies the problem of modeling learning through a set of agents connected via a social network. We first analyze a robust detection problem in a tandem network where agents sequentially receive private signals about the state of the world, as well as the decision of their predecesso...
Saved in:
| 主要作者: | |
|---|---|
| 其他作者: | |
| 格式: | Theses and Dissertations |
| 語言: | English |
| 出版: |
2019
|
| 主題: | |
| 在線閱讀: | https://hdl.handle.net/10356/85449 http://hdl.handle.net/10220/50121 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 機構: | Nanyang Technological University |
| 語言: | English |
| 總結: | This thesis studies the problem of modeling learning through a set of agents connected via a social network.
We first analyze a robust detection problem in a tandem network where agents sequentially receive private signals about the state of the world, as well as the decision of their predecessors, and then attempt to make a decision about the state of the world. The knowledge they have regarding their predecessors' private signals, however, is incomplete, and we propose a policy to allow agents to minimize the worst-case error probability over all possible distributions of their predecessors' private signals.
We then consider the problem of online advertising, where an online retailer wishes to learn more about users in a social network. We model the problem in a variety of different ways. One of these models is optimizing a string-submodular function with incomplete information about the step-wise gains of each user. Another is through two different multi-armed bandit models. |
|---|