Long Tran-Thanh

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Nicholas Bishop

> Home > Persons > Long Tran-Thanh

Publications

2022
[c74]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - conf/aaai/BishopCMT22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/aaai/BishopCMT22
Nicholas Bishop, Hau Chan, Debmalya Mandal, Long Tran-Thanh:
Sequential Blocked Matching. AAAI 2022: 4834-4842
2021
[c65]
- view
  authority control:
- export record
  dblp key:
  - conf/atal/BishopDT21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/atal/BishopDT21
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
[i26]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2108-00073
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2108-00073
Nicholas Bishop, Hau Chan, Debmalya Mandal, Long Tran-Thanh:
Sequential Blocked Matching. CoRR abs/2108.00073 (2021)
[i23]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-2110-13532
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2110-13532
Shivakumar Mahesh, Nicholas Bishop, Le Cong Dinh, Long Tran-Thanh:
Playing Repeated Coopetitive Polymatrix Games with Small Manipulation Cost. CoRR abs/2110.13532 (2021)

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.