2 papers
cs.DS2024
A Sierpinski Triangle Data Structure for Efficient Array Value Update and Prefix Sum Calculation
Brent Harrison, Jason Necaise, Andrew Projansky +1
The binary indexed tree, or Fenwick tree, is a data structure that can efficiently update values and calculate prefix sums in an array. It allows both of these operations to be per…
cs.GT2022
Modelling Cournot Games as Multi-agent Multi-armed Bandits
Kshitija Taywade, Brent Harrison, Adib Bagh
We investigate the use of a multi-agent multi-armed bandit (MA-MAB) setting for modeling repeated Cournot oligopoly games, where the firms acting as agents choose from the set of a…