default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMuhammad Aneeq uz Zaman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Abdullah Alawad, Muhammad Aneeq uz Zaman, Khaled Alshehri, Tamer Basar:
Prosumers Participation in Markets: A Scalar-Parameterized Function Bidding Approach. ACC 2024: 3921-3926- [c10]Muhammad Aneeq uz Zaman, Mathieu Laurière, Alec Koppel, Tamer Basar:
Robust cooperative multi-agent reinforcement learning: A mean-field type game perspective. L4DC 2024: 770-783 - [i14]Muhammad Aneeq uz Zaman, Alec Koppel, Mathieu Laurière, Tamer Basar:
Independent RL for Cooperative-Competitive Agents: A Mean-Field Perspective. CoRR abs/2403.11345 (2024) - [i13]Muhammad Aneeq uz Zaman, Shubham Aggarwal, Melih Bastopcu, Tamer Basar:
Policy Optimization finds Nash Equilibrium in Regularized General-Sum LQ Games. CoRR abs/2404.00045 (2024) - [i12]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Sennur Ulukus, Tamer Basar:
A Mean Field Game Model for Timely Computation in Edge Computing Systems. CoRR abs/2404.02898 (2024) - [i11]Muhammad Aneeq uz Zaman, Mathieu Laurière, Alec Koppel, Tamer Basar:
Robust Cooperative Multi-Agent Reinforcement Learning:A Mean-Field Type Game Perspective. CoRR abs/2406.13992 (2024) - [i10]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Semantic Communication in Multi-team Dynamic Games: A Mean Field Perspective. CoRR abs/2407.06528 (2024) - 2023
- [j2]Muhammad Aneeq uz Zaman
, Erik Miehling, Tamer Basar:
Reinforcement Learning for Non-stationary Discrete-Time Linear-Quadratic Mean-Field Games in Multiple Populations. Dyn. Games Appl. 13(1): 118-164 (2023) - [j1]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Weighted Age of Information-Based Scheduling for Large Population Games on Networks. IEEE J. Sel. Areas Inf. Theory 4: 682-697 (2023) - [c9]Muhammad Aneeq uz Zaman, Alec Koppel, Sujay Bhatt, Tamer Basar:
Oracle-free Reinforcement Learning in Mean-Field Games along a Single Sample Path. AISTATS 2023: 10178-10206 - [c8]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Large Population Games with Timely Scheduling over Constrained Networks. ACC 2023: 4772-4778 - [c7]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Large Population Games on Constrained Unreliable Networks. CDC 2023: 3480-3485 - [c6]Umer Huzaifa, Dimuthu D. K. Arachchige, Muhammad Aneeq uz Zaman, Usman Syed:
Simplified Modeling of Hybrid Soft Robots with Constant Stiffness Assumption. ROBIO 2023: 1-6 - [i9]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Large Population Games on Constrained Unreliable Networks. CoRR abs/2303.09515 (2023) - [i8]Abdullah Alawad, Muhammad Aneeq uz Zaman, Khaled Alshehri, Tamer Basar:
Prosumers Participation in Markets: A Scalar-Parameterized Function Bidding Approach. CoRR abs/2309.15423 (2023) - 2022
- [c5]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Tamer Basar:
Linear Quadratic Mean-Field Games with Communication Constraints. ACC 2022: 1323-1329 - [i7]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Tamer Basar:
Linear Quadratic Mean-Field Games with Communication Constraints. CoRR abs/2203.05686 (2022) - [i6]Muhammad Aneeq uz Zaman, Alec Koppel, Sujay Bhatt, Tamer Basar:
Oracle-free Reinforcement Learning in Mean-Field Games along a Single Sample Path. CoRR abs/2208.11639 (2022) - [i5]Shubham Aggarwal, Muhammad Aneeq uz Zaman, Melih Bastopcu, Tamer Basar:
Weighted Age of Information based Scheduling for Large Population Games on Networks. CoRR abs/2209.12888 (2022) - 2021
- [c4]Muhammad Aneeq uz Zaman, Sujay Bhatt, Tamer Basar:
Adversarial Linear-Quadratic Mean-Field Games over Multigraphs. CDC 2021: 209-214 - [i4]Muhammad Aneeq uz Zaman, Sujay Bhatt, Tamer Basar:
Adversarial Linear-Quadratic Mean-Field Games over Multigraphs. CoRR abs/2109.14461 (2021) - 2020
- [c3]Muhammad Aneeq uz Zaman, Kaiqing Zhang, Erik Miehling, Tamer Basar:
Approximate Equilibrium Computation for Discrete-Time Linear-Quadratic Mean-Field Games. ACC 2020: 333-339 - [c2]Muhammad Aneeq uz Zaman, Kaiqing Zhang, Erik Miehling, Tamer Basar:
Reinforcement Learning in Non-Stationary Discrete-Time Linear-Quadratic Mean-Field Games. CDC 2020: 2278-2284 - [c1]Muhammad Aneeq uz Zaman, Sujay Bhatt, Tamer Basar:
Secure Discrete-Time Linear-Quadratic Mean-Field Games. GameSec 2020: 203-222 - [i3]Muhammad Aneeq uz Zaman, Kaiqing Zhang, Erik Miehling, Tamer Basar:
Approximate Equilibrium Computation for Discrete-Time Linear-Quadratic Mean-Field Games. CoRR abs/2003.13195 (2020) - [i2]Muhammad Aneeq uz Zaman, Aamer Iqbal Bhatti:
Multi-agent Planning for thermalling gliders using multi level graph-search. CoRR abs/2007.01334 (2020) - [i1]Muhammad Aneeq uz Zaman, Kaiqing Zhang, Erik Miehling, Tamer Basar:
Reinforcement Learning in Non-Stationary Discrete-Time Linear-Quadratic Mean-Field Games. CoRR abs/2009.04350 (2020)
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-09-22 23:36 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:
