@prefix dcat: <http://www.w3.org/ns/dcat#> .
@prefix dct: <http://purl.org/dc/terms/> .
@prefix foaf: <http://xmlns.com/foaf/0.1/> .
@prefix vcard: <http://www.w3.org/2006/vcard/ns#> .
@prefix xsd: <http://www.w3.org/2001/XMLSchema#> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00595695v3> a dcat:Dataset ;
    dct:description """
              Approachability has become a standard tool in analyzing earning algorithms in the adversarial online learning setup. We develop a variant of approachability for games where there is ambiguity in the obtained reward that belongs to a set, rather than being a single vector. Using this variant we tackle the problem of approachability in games with partial monitoring and develop simple and efficient algorithms (i.e., with constant per-step complexity) for this setup. We finally consider external regret and internal regret in repeated games with partial monitoring and derive regret-minimizing strategies based on approachability theory.
            """ ;
    dct:identifier "hal-00595695" ;
    dct:issued "2026-05-28T14:37:19.461969"^^xsd:dateTime ;
    dct:language "en" ;
    dct:modified "2026-05-28T14:37:19.461974"^^xsd:dateTime ;
    dct:publisher <https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> ;
    dct:title "Robust approachability and regret minimization in games with partial monitoring" ;
    dcat:contactPoint [ a vcard:Organization ;
            vcard:fn "CCSD" ] ;
    dcat:distribution <https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00595695v3/resource/3794fc8b-b941-4aef-8e33-ff20f8009210> ;
    dcat:keyword "infoeu-reposemanticspreprint",
        "infoinfo-lgcomputer-science-csmachine-learning-cslg",
        "mathmath-stmathematics-mathstatistics-mathst",
        "preprints-working-papers-",
        "statthstatistics-statstatistics-theory-statth" ;
    dcat:landingPage <https://hal.science/hal-00595695> .

<https://rec.harvest-normandie.data4citizen.com/dataset/oai-hal-hal-00595695v3/resource/3794fc8b-b941-4aef-8e33-ff20f8009210> a dcat:Distribution ;
    dct:format "HTML" ;
    dct:issued "2026-05-28T14:37:19.474970"^^xsd:dateTime ;
    dct:modified "2026-05-28T14:37:19.446745"^^xsd:dateTime ;
    dct:title "Robust approachability and regret minimization in games with partial monitoring" ;
    dcat:accessURL <https://hal.science/hal-00595695> .

<https://rec.harvest-normandie.data4citizen.com/organization/cce9db95-46d9-4dc2-84b6-764215d0a002> a foaf:Agent ;
    foaf:name "test_moissonnage_selune" .

<https://hal.science/hal-00595695> a foaf:Document .