Show simple item record

dc.contributor.authorMeng, X Flora
dc.contributor.authorSarkar, Tuhin
dc.contributor.authorDahleh, Munther A
dc.date.accessioned2022-06-13T17:54:00Z
dc.date.available2022-06-13T17:54:00Z
dc.date.issued2021-12-14
dc.identifier.urihttps://hdl.handle.net/1721.1/143103
dc.language.isoen
dc.publisherIEEEen_US
dc.relation.isversionof10.1109/cdc45484.2021.9683459en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleNonstochastic Bandits with Infinitely Many Expertsen_US
dc.typeArticleen_US
dc.identifier.citationMeng, X Flora, Sarkar, Tuhin and Dahleh, Munther A. 2021. "Nonstochastic Bandits with Infinitely Many Experts." 2021 60th IEEE Conference on Decision and Control (CDC).
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
dc.relation.journal2021 60th IEEE Conference on Decision and Control (CDC)en_US
dc.eprint.versionOriginal manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
eprint.statushttp://purl.org/eprint/status/NonPeerRevieweden_US
dc.date.updated2022-06-13T17:48:02Z
dspace.orderedauthorsMeng, XF; Sarkar, T; Dahleh, MAen_US
dspace.date.submission2022-06-13T17:48:03Z
mit.licenseOPEN_ACCESS_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record