default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZun Li 0002
Person information
- affiliation: Google DeepMind, USA
- affiliation (former): University of Michigan, Ann Arbor, MI, USA
- affiliation (former): Shanghai Jiao Tong University, China
Other persons with the same name
- Zun Li 0001
![[0000-0001-6100-2788]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0001-6100-2788")
— Beijing University of Technology, Faculty of Information Technology, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]Zun Li, Michael P. Wellman:
A Meta-Game Evaluation Framework for Deep Multiagent Reinforcement Learning. IJCAI 2024: 148-156- [i5]Zun Li, Michael P. Wellman:
A Meta-Game Evaluation Framework for Deep Multiagent Reinforcement Learning. CoRR abs/2405.00243 (2024) - 2023
- [j1]Qinya Li, Zun Li, Zhenzhe Zheng, Fan Wu, Shaojie Tang, Zhao Zhang, Guihai Chen:
Capitalize Your Data: Optimal Selling Mechanisms for IoT Data Exchange. IEEE Trans. Mob. Comput. 22(4): 1988-2000 (2023) - [c7]Zun Li, Marc Lanctot, Kevin R. McKee, Luke Marris, Ian Gemp, Daniel Hennes, Kate Larson, Yoram Bachrach, Michael P. Wellman, Paul Muller:
Search-Improved Game-Theoretic Multiagent Reinforcement Learning in General and Negotiation Games. AAMAS 2023: 2445-2447 - [c6]Zun Li:
Artificial Intelligence Algorithms for Strategic Reasoning over Complex Multiagent Systems. AAMAS 2023: 2931-2933 - [i4]Zun Li, Marc Lanctot, Kevin R. McKee, Luke Marris, Ian Gemp, Daniel Hennes, Paul Muller, Kate Larson, Yoram Bachrach, Michael P. Wellman:
Combining Tree-Search, Generative Models, and Nash Bargaining Concepts in Game-Theoretic Reinforcement Learning. CoRR abs/2302.00797 (2023) - [i3]Marc Lanctot, Kate Larson, Yoram Bachrach, Luke Marris, Zun Li, Avishkar Bhoopchand, Thomas W. Anthony, Brian Tanner, Anna Koop:
Evaluating Agents using Social Choice Theory. CoRR abs/2312.03121 (2023) - 2022
- [c5]Zun Li, Feiran Jia, Aditya Mate, Shahin Jabbari, Mithun Chakraborty, Milind Tambe, Yevgeniy Vorobeychik:
Solving structured hierarchical games using differential backward induction. UAI 2022: 1107-1117 - 2021
- [c4]Zun Li, Michael P. Wellman:
Evolution Strategies for Approximate Solution of Bayesian Games. AAAI 2021: 5531-5540 - [i2]Feiran Jia, Aditya Mate, Zun Li, Shahin Jabbari, Mithun Chakraborty, Milind Tambe, Michael P. Wellman, Yevgeniy Vorobeychik:
A Game-Theoretic Approach for Hierarchical Policy-Making. CoRR abs/2102.10646 (2021) - [i1]Zun Li, Feiran Jia, Aditya Mate, Shahin Jabbari, Mithun Chakraborty, Milind Tambe, Yevgeniy Vorobeychik:
Solving Structured Hierarchical Games Using Differential Backward Induction. CoRR abs/2106.04663 (2021) - 2020
- [c3]Zun Li, Michael P. Wellman:
Structure Learning for Approximate Solution of Many-Player Games. AAAI 2020: 2119-2127 - [c2]Steven Jecmen, Arunesh Sinha, Zun Li, Long Tran-Thanh:
Bounding Regret in Empirical Games. AAAI 2020: 4280-4287
2010 – 2019
- 2018
- [c1]Zun Li, Zhenzhe Zheng, Fan Wu, Guihai Chen:
On Designing Optimal Data Purchasing Strategies for Online Ad Auctions. AAMAS 2018: 1522-1530
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-21 21:31 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:
