10 citations · 18 across the 10 of their papers we have counts for
4 papers · 1 filter
Collaboratively Learning the Best Option on Graphs, Using Bounded Local Memory
Lili Su, Martin Zubeldia, Nancy Lynch
We consider multi-armed bandit problems in social groups wherein each individual has bounded memory and shares the common goal of learning the best arm/option. We say an individual…
Self-Stabilizing Task Allocation In Spite of Noise
Anna Dornhaus, Nancy Lynch, Frederik Mallmann-Trenn +2
We study the problem of distributed task allocation inspired by the behavior of social insects, which perform task allocation in a setting of limited capabilities and noisy environ…
On Simple Back-Off in Unreliable Radio Networks
Seth Gilbert, Nancy Lynch, Calvin Newport +1
In this paper, we study local and global broadcast in the dual graph model, which describes communication in a radio network with both reliable and unreliable links. Existing work…
Collaboratively Learning the Best Option, Using Bounded Memory
Lili Su, Martin Zubeldia, Nancy Lynch
We consider multi-armed bandit problems in social groups wherein each individual has bounded memory and shares the common goal of learning the best arm/option. We say an individual…