Nima Akbarzadeh

Orcid: 0000-0002-7483-2569

According to our database1, Nima Akbarzadeh authored at least 13 papers between 2016 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On Learning Whittle Index Policy for Restless Bandits With Scalable Regret.
IEEE Trans. Control. Netw. Syst., September, 2024

Two families of indexable partially observable restless bandits and Whittle index computation.
Perform. Evaluation, 2024

Planning and Learning in Risk-Aware Restless Multi-Arm Bandit Problem.
CoRR, 2024

2023
Approximate information state based convergence analysis of recurrent Q-learning.
CoRR, 2023

2022
Scalable Operator Allocation for Multirobot Assistance: A Restless Bandit Approach.
IEEE Trans. Control. Netw. Syst., 2022

Partially observable restless bandits with restarts: indexability and computation of Whittle index.
Proceedings of the 61st IEEE Conference on Decision and Control, 2022

2021
Scalable Operator Allocation for Multi-Robot Assistance: A Restless Bandit Approach.
CoRR, 2021

Maintenance of a collection of machines under partial observability: Indexability and computation of Whittle index.
CoRR, 2021

2020
Restless bandits: indexability and computation of Whittle index.
CoRR, 2020

2019
Dynamic spectrum access under partial observations: A restless bandit approach.
Proceedings of the 16th Canadian Workshop on Information Theory, 2019

Restless bandits with controlled restarts: Indexability and computation of Whittle index.
Proceedings of the 58th IEEE Conference on Decision and Control, 2019

2018
Online Learning in Limit Order Book Trade Execution.
IEEE Trans. Signal Process., 2018

2016
Gambler's Ruin Bandit Problem.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016


  Loading...