default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNima Akbarzadeh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Nima Akbarzadeh
, Aditya Mahajan:
Two families of indexable partially observable restless bandits and Whittle index computation. Perform. Evaluation 163: 102394 (2024)- [j3]Nima Akbarzadeh, Aditya Mahajan:
On Learning Whittle Index Policy for Restless Bandits With Scalable Regret. IEEE Trans. Control. Netw. Syst. 11(3): 1190-1202 (2024) - 2023
- [i6]Erfan Seyedsalehi, Nima Akbarzadeh, Amit Sinha, Aditya Mahajan:
Approximate information state based convergence analysis of recurrent Q-learning. CoRR abs/2306.05991 (2023) - 2022
- [j2]Abhinav Dahiya, Nima Akbarzadeh, Aditya Mahajan, Stephen L. Smith:
Scalable Operator Allocation for Multirobot Assistance: A Restless Bandit Approach. IEEE Trans. Control. Netw. Syst. 9(3): 1397-1408 (2022) - [c5]Nima Akbarzadeh, Aditya Mahajan:
Partially observable restless bandits with restarts: indexability and computation of Whittle index. CDC 2022: 4898-4904 - [i5]Nima Akbarzadeh, Aditya Mahajan:
On learning Whittle index policy for restless bandits with scalable regret. CoRR abs/2202.03463 (2022) - 2021
- [i4]Nima Akbarzadeh, Aditya Mahajan:
Maintenance of a collection of machines under partial observability: Indexability and computation of Whittle index. CoRR abs/2104.05151 (2021) - [i3]Abhinav Dahiya, Nima Akbarzadeh, Aditya Mahajan, Stephen L. Smith:
Scalable Operator Allocation for Multi-Robot Assistance: A Restless Bandit Approach. CoRR abs/2111.06437 (2021) - 2020
- [i2]Nima Akbarzadeh, Aditya Mahajan:
Restless bandits: indexability and computation of Whittle index. CoRR abs/2008.06111 (2020)
2010 – 2019
- 2019
- [c4]Nima Akbarzadeh, Aditya Mahajan:
Restless bandits with controlled restarts: Indexability and computation of Whittle index. CDC 2019: 7294-7300 - [c3]Nima Akbarzadeh, Aditya Mahajan:
Dynamic spectrum access under partial observations: A restless bandit approach. CWIT 2019: 1-6 - 2018
- [j1]Nima Akbarzadeh, Cem Tekin, Mihaela van der Schaar:
Online Learning in Limit Order Book Trade Execution. IEEE Trans. Signal Process. 66(17): 4626-4641 (2018) - 2017
- [c2]Nima Akbarzadeh, Cem Tekin, Mihaela van der Schaar:
Online learning in limit order book trade execution. GlobalSIP 2017: 898-902 - 2016
- [c1]Nima Akbarzadeh, Cem Tekin:
Gambler's Ruin Bandit Problem. Allerton 2016: 1236-1243 - [i1]Nima Akbarzadeh, Cem Tekin:
Gambler's Ruin Bandit Problem. CoRR abs/1605.06651 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
