1 citations · 3 across the 19 of their papers we have counts for
Showing 2020Show all
3 papers · 1 filter
cs.LG2020
Streaming Algorithms for Stochastic Multi-armed Bandits
Arnab Maiti, Vishakha Patil, Arindam Khan
We study the Stochastic Multi-armed Bandit problem under bounded arm-memory. In this setting, the arms arrive in a stream, and the number of arms that can be stored in the memory a…
cs.GT2020★ 1 cited
On Parameterized Complexity of Binary Networked Public Goods Game
Arnab Maiti, Palash Dey
In the Binary Networked Public Goods game, every player needs to decide if she participates in a public project whose utility is shared equally by the community. We study the probl…
cs.GT2020
On Parameterized Complexity of Liquid Democracy
Palash Dey, Arnab Maiti, Amatya Sharma
In liquid democracy, each voter either votes herself or delegates her vote to some other voter. This gives rise to what is called a delegation graph. To decide the voters who event…