Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory-Reference-Cited by-同舟云学术

Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory

Published:2019-06-20 Issue: Volume: Page:
ISSN:
Container-title:Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems
language:
Short-container-title:

Author:

Su Lili¹,Zubeldia Martin¹,Lynch Nancy¹

Affiliation:

1. Massachusetts Institute of Technology, Cambridge, MA, USA

Funder

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3309697.3331498

Reference16 articles.

1. Peter Auer Nicolo Cesa-Bianchi and Paul Fischer. 2002. Finite-time analysis of the multiarmed bandit problem. Machine learning Vol. 47 2--3 (2002) 235--256. 10.1023/A:1013689704352 Peter Auer Nicolo Cesa-Bianchi and Paul Fischer. 2002. Finite-time analysis of the multiarmed bandit problem. Machine learning Vol. 47 2--3 (2002) 235--256. 10.1023/A:1013689704352

2. Albert Bandura. 1969. Social-learning theory of identificatory processes. Handbook of socialization theory and research Vol. 213 (1969) 262. Albert Bandura. 1969. Social-learning theory of identificatory processes. Handbook of socialization theory and research Vol. 213 (1969) 262.

3. Learning and Strategic Pricing

4. Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems

5. The two-armed-bandit problem with time-invariant finite memory

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Distributed Privacy-Preserving Learning Dynamics in General Social Networks;IEEE Transactions on Knowledge and Data Engineering;2023-09-01