Please use this identifier to cite or link to this item:
|Title:||Learning models in social networks||Authors:||Ho, Jack||Keywords:||Engineering::Mathematics and analysis::Simulations||Issue Date:||2019||Source:||Ho, J. (2019). Learning models in social networks. Doctoral thesis, Nanyang Technological University, Singapore.||Abstract:||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.||URI:||https://hdl.handle.net/10356/85449
|Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||EEE Theses|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.