Stephen J. Roberts

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 Anup Aprem

> Home > Persons > Stephen J. Roberts

Publications

2021
[j52]
- view
  authority control:
- export record
  dblp key:
  - journals/cj/ApremR21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cj/ApremR21
Anup Aprem, Stephen Roberts:
A Bayesian Optimization Approach to Compute Nash Equilibrium of Potential Games Using Bandit Feedback. Comput. J. 64(12): 1801-1813 (2021)
[j51]
- view
  authority control:
- export record
  dblp key:
  - journals/ijon/ApremR21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijon/ApremR21
Anup Aprem, Stephen J. Roberts:
Optimal pricing in black box producer-consumer Stackelberg games using revealed preference feedback. Neurocomputing 437: 31-41 (2021)
2019
[c81]
- view
  authority control:
- export record
  dblp key:
  - conf/mlsp/ApremR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mlsp/ApremR19
Anup Aprem, Stephen J. Roberts:
Optimal Pricing In Black Box Producer-Consumer Stackelberg Games Using Revealed Preference Feedback. MLSP 2019: 1-6
2018
[i21]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-1811-06503
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1811-06503
Anup Aprem, Stephen J. Roberts:
A Bayesian optimization approach to compute the Nash equilibria of potential games using bandit feedback. CoRR abs/1811.06503 (2018)

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.