default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLe Cong Dinh
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j3]Le Cong Dinh
, David Henry Mguni, Long Tran-Thanh, Jun Wang, Yaodong Yang:
Online Markov decision processes with non-oblivious strategic adversary. Auton. Agents Multi Agent Syst. 37(1): 15 (2023)- [j2]Nhat Van-Quoc Truong, Le Cong Dinh, Sebastian Stein, Long Tran-Thanh, Nicholas R. Jennings:
Efficient and adaptive incentive selection for crowdsourcing contests. Appl. Intell. 53(8): 9204-9234 (2023) - 2022
- [j1]Le Cong Dinh, Stephen Marcus McAleer, Zheng Tian, Nicolas Perez Nieves, Oliver Slumbers, David Henry Mguni, Jun Wang, Haitham Bou-Ammar, Yaodong Yang:
Online Double Oracle. Trans. Mach. Learn. Res. 2022 (2022)
Conference and Workshop Papers
- 2024
- [c6]Le Cong Dinh, David Henry Mguni, Long Tran-Thanh, Jun Wang, Yaodong Yang:
A Summary of Online Markov Decision Processes with Non-oblivious Strategic Adversary. AAMAS 2024: 2830-2832 - 2023
- [c5]Shivakumar Mahesh, Nicholas Bishop, Le Cong Dinh, Long Tran-Thanh:
Playing Repeated Coopetitive Polymatrix Games with Small Manipulation Cost. GameSec 2023: 257-276 - [c4]Xiaohang Tang, Le Cong Dinh, Stephen Marcus McAleer, Yaodong Yang:
Regret-Minimizing Double Oracle for Extensive-Form Games. ICML 2023: 33599-33615 - 2022
- [c3]Le Cong Dinh:
Online Learning against Strategic Adversary. AAMAS 2022: 1841-1842 - 2021
- [c2]Le Cong Dinh, Tri-Dung Nguyen, Alain B. Zemkoho, Long Tran-Thanh:
Last Round Convergence and No-Dynamic Regret in Asymmetric Repeated Games. ALT 2021: 553-577 - [c1]Nicholas Bishop, Le Cong Dinh, Long Tran-Thanh:
How to Guide a Non-Cooperative Learner to Cooperate: Exploiting No-Regret Algorithms in System Design. AAMAS 2021: 1464-1466
Informal and Other Publications
- 2023
- [i7]Le Cong Dinh, Tri-Dung Nguyen, Alain B. Zemkoho, Long Tran-Thanh:
Achieving Better Regret against Strategic Adversaries. CoRR abs/2302.06652 (2023) - [i6]Xiaohang Tang, Le Cong Dinh, Stephen Marcus McAleer, Yaodong Yang:
Regret-Minimizing Double Oracle for Extensive-Form Games. CoRR abs/2304.10498 (2023) - 2021
- [i5]Le Cong Dinh, Yaodong Yang, Zheng Tian, Nicolas Perez Nieves, Oliver Slumbers, David Henry Mguni, Haitham Bou-Ammar, Jun Wang:
Online Double Oracle. CoRR abs/2103.07780 (2021) - [i4]Le Cong Dinh, David Henry Mguni, Long Tran-Thanh, Jun Wang, Yaodong Yang:
Online Markov Decision Processes with Non-oblivious Strategic Adversary. CoRR abs/2110.03604 (2021) - [i3]Shivakumar Mahesh, Nicholas Bishop, Le Cong Dinh, Long Tran-Thanh:
Playing Repeated Coopetitive Polymatrix Games with Small Manipulation Cost. CoRR abs/2110.13532 (2021) - 2020
- [i2]Le Cong Dinh, Long Tran-Thanh, Tri-Dung Nguyen, Alain B. Zemkoho:
Last Round Convergence and No-Instant Regret in Repeated Games with Asymmetric Information. CoRR abs/2003.11727 (2020) - [i1]Le Cong Dinh, Nick Bishop, Long Tran-Thanh:
Exploiting No-Regret Algorithms in System Design. CoRR abs/2007.11172 (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-10-04 21:01 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:
