<?xml version="1.0" encoding="UTF-8"?>
<oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
  <dc:title>Solving Complex Game Problems using Gaussian Processes</dc:title>
  <dc:title>R package GPGame version 1.2.1</dc:title>
  <dc:description>Sequential strategies for finding a game equilibrium are proposed in a black-box setting (expensive pay-off evaluations, no derivatives). The algorithm handles noiseless or noisy evaluations. Two acquisition functions are available. Graphical outputs can be generated automatically. V. Picheny, M. Binois, A. Habbal (2018) &lt;doi:10.1007/s10898-018-0688-0&gt;. M. Binois, V. Picheny, P. Taillandier, A. Habbal (2020) &lt;doi:10.48550/arXiv.1902.06565&gt;.</dc:description>
  <dc:type>Software</dc:type>
  <dc:relation>Imports: Rcpp (&gt;= 0.12.5), DiceKriging, GPareto, KrigInv, DiceDesign,
MASS, mnormt, mvtnorm, methods, matrixStats</dc:relation>
  <dc:relation>LinkingTo: Rcpp</dc:relation>
  <dc:relation>Suggests: DiceOptim, testthat</dc:relation>
  <dc:creator>Mickael Binois &lt;mickael.binois@inria.fr&gt;</dc:creator>
  <dc:publisher>Comprehensive R Archive Network (CRAN)</dc:publisher>
  <dc:contributor>Victor Picheny [aut] (ORCID: &lt;https://orcid.org/0000-0002-4948-5542&gt;),
  Mickael Binois [aut, cre] (ORCID:
    &lt;https://orcid.org/0000-0002-7225-1680&gt;)</dc:contributor>
  <dc:rights>GPL-3</dc:rights>
  <dc:date>2025-11-14</dc:date>
  <dc:format>application/tgz</dc:format>
  <dc:identifier>https://CRAN.R-project.org/package=GPGame</dc:identifier>
  <dc:identifier>doi:10.32614/CRAN.package.GPGame</dc:identifier>
</oai_dc:dc>
