[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/focs/FreundKMRRS95>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Dana_Ron>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Michael_J._Kearns>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Robert_E._Schapire>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Ronitt_Rubinfeld>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Yishay_Mansour>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Yoav_Freund>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1109%2FSFCS.1995.492489>
foaf:homepage <https://doi.org/10.1109/SFCS.1995.492489>
dc:identifier DBLP conf/focs/FreundKMRRS95 (xsd:string)
dc:identifier DOI doi.org%2F10.1109%2FSFCS.1995.492489 (xsd:string)
dcterms:issued 1995 (xsd:gYear)
rdfs:label Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Dana_Ron>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Michael_J._Kearns>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Robert_E._Schapire>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Ronitt_Rubinfeld>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Yishay_Mansour>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Yoav_Freund>
swrc:pages 332-341 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/focs/1995>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/focs/FreundKMRRS95/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/focs/FreundKMRRS95>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/focs/focs95.html#FreundKMRRS95>
rdfs:seeAlso <https://doi.org/10.1109/SFCS.1995.492489>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/focs>
dc:subject finite automata; game theory; learning (artificial intelligence); repeated games playing; computationally bounded adversaries; computational efficiency; learning algorithm; penny-matching; classically studied finite automata (xsd:string)
dc:title Efficient Algorithms for Learning to Play Repeated Games Against Computationally Bounded Adversaries. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document