Optimal strategies and minimax lower bounds for online convex games [Technical Report No. UCB/EECS-2008-19]

Abernethy, Jacob, Bartlett, Peter, Rakhlin, Alexander, & Tewari, Ambuj (2008) Optimal strategies and minimax lower bounds for online convex games [Technical Report No. UCB/EECS-2008-19]. University of California, Berkeley, United States of America.

Impact and interest:

Citation counts are sourced monthly from Scopus and Web of Science® citation databases.

These databases contain citations from different subsets of available publications and different time periods and thus the citation count from each is usually different. Some works are not in either database and no count is displayed. Scopus includes citations from articles published in 1996 onwards, and Web of Science® generally from 1980 onwards.

Citations counts from the Google Scholar™ indexing service can be viewed at the linked Google Scholar™ search.

ID Code: 80748
Item Type: Report
Refereed: Yes
Deposited On: 21 Jan 2015 22:49
Last Modified: 21 Jan 2015 22:51

Export: EndNote | Dublin Core | BibTeX

Repository Staff Only: item control page