Gerald Tesauro

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 Jakob N. Foerster

> Home > Persons > Gerald Tesauro

Publications

2022
[c66]
- view
  - electronic edition @ nips.cc (open access)
  - no references & citations available
- export record
  dblp key:
  - conf/nips/KimRLFESTH22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/nips/KimRLFESTH22
Dong-Ki Kim, Matthew Riemer, Miao Liu, Jakob N. Foerster, Michael Everett, Chuangchuang Sun, Gerald Tesauro, Jonathan P. How:
Influencing Long-Term Behavior in Multiagent Reinforcement Learning. NeurIPS 2022
[i26]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2203-03535
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2203-03535
Dong-Ki Kim, Matthew Riemer, Miao Liu, Jakob N. Foerster, Michael Everett, Chuangchuang Sun, Gerald Tesauro, Jonathan P. How:
Influencing Long-Term Behavior in Multiagent Reinforcement Learning. CoRR abs/2203.03535 (2022)
[i25]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2210-16175
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2210-16175
Dong-Ki Kim, Matthew Riemer, Miao Liu, Jakob N. Foerster, Gerald Tesauro, Jonathan P. How:
Game-Theoretical Perspectives on Active Equilibria: A Preferred Solution Concept over Nash Equilibria. CoRR abs/2210.16175 (2022)

a service of

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.