{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:42:21Z","timestamp":1742913741004,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319666990"},{"type":"electronic","value":"9783319667003"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66700-3_20","type":"book-chapter","created":{"date-parts":[[2017,8,18]],"date-time":"2017-08-18T12:38:47Z","timestamp":1503059927000},"page":"252-263","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Hedging Under Uncertainty: Regret Minimization Meets Exponentially Fast Convergence"],"prefix":"10.1007","author":[{"given":"Johanne","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Am\u00e9lie","family":"H\u00e9liou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panayotis","family":"Mertikopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,19]]},"reference":[{"issue":"1","key":"20_CR1","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. 8(1), 121\u2013164 (2012)","journal-title":"Theory Comput."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Hajiaghayi, M.T., Ligett, K., Roth, A.: Regret minimization and the price of total anarchy. In: STOC 2008: Proceedings of the 40th Annual ACM Symposium on the Theory of Computing, pp. 373\u2013382. ACM (2008)","DOI":"10.1145\/1374376.1374430"},{"key":"20_CR3","volume-title":"Algorithmic Game Theory","author":"A Blum","year":"2007","unstructured":"Blum, A., Mansour, Y.: Learning, regret minimization, and equilibria (Chap. 4). In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V.V. (eds.) Algorithmic Game Theory. Cambridge University Press, Cambridge (2007)"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000024","volume":"5","author":"S Bubeck","year":"2012","unstructured":"Bubeck, S., Cesa-Bianchi, N.: Regret analysis of stochastic and nonstochastic multi-armed bandit problems. Found. Trends Mach. Learn. 5(1), 1\u2013122 (2012)","journal-title":"Found. Trends Mach. Learn."},{"key":"20_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, Cambridge (2006)"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1287\/moor.2014.0687","volume":"40","author":"P Coucheney","year":"2015","unstructured":"Coucheney, P., Gaujal, B., Mertikopoulos, P.: Penalty-regulated dynamics and robust learning procedures in games. Math. Oper. Res. 40(3), 611\u2013633 (2015)","journal-title":"Math. Oper. Res."},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1006\/game.1997.0595","volume":"21","author":"D Foster","year":"1997","unstructured":"Foster, D., Vohra, R.V.: Calibrated learning and correlated equilibrium. Games Econ. Behav. 21(1), 40\u201355 (1997)","journal-title":"Games Econ. Behav."},{"key":"20_CR8","unstructured":"Foster, D.J., Lykouris, T., Sridharan, K., Tardos, E.: Learning in games: robustness of fast convergence. In: Advances in Neural Information Processing Systems, pp. 4727\u20134735 (2016)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1006\/game.1999.0738","volume":"29","author":"Y Freund","year":"1999","unstructured":"Freund, Y., Schapire, R.E.: Adaptive game playing using multiplicative weights. Games Econ. Behav. 29, 79\u2013103 (1999)","journal-title":"Games Econ. Behav."},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"24:1","DOI":"10.1145\/2956582","volume":"4","author":"PW Goldberg","year":"2016","unstructured":"Goldberg, P.W., Roth, A.: Bounds for the query complexity of approximate equilibria. ACM Trans. Econ. Comput. 4(4), 24:1\u201324:25 (2016)","journal-title":"ACM Trans. Econ. Comput."},{"key":"20_CR11","series-title":"Probability and Mathematical Statistics","volume-title":"Martingale Limit Theory and Its Application","author":"P Hall","year":"1980","unstructured":"Hall, P., Heyde, C.C.: Martingale Limit Theory and Its Application. Probability and Mathematical Statistics. Academic Press, New York (1980)"},{"key":"20_CR12","series-title":"Annals of Mathematics Studies","first-page":"97","volume-title":"Contributions to the Theory of Games","author":"J Hannan","year":"1957","unstructured":"Hannan, J.: Approximation to Bayes risk in repeated play. In: Dresher, M., Tucker, A.W., Wolfe, P. (eds.) Contributions to the Theory of Games. Annals of Mathematics Studies, vol. 39, pp. 97\u2013139. Princeton University Press, Princeton (1957)"},{"issue":"5","key":"20_CR13","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1111\/1468-0262.00153","volume":"68","author":"S Hart","year":"2000","unstructured":"Hart, S., Mas-Colell, A.: A simple adaptive procedure leading to correlated equilibrium. Econometrica 68(5), 1127\u20131150 (2000)","journal-title":"Econometrica"},{"issue":"3","key":"20_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A Kalai","year":"2005","unstructured":"Kalai, A., Vempala, S.: Efficient algorithms for online decision problems. J. Comput. Syst. Sci. 71(3), 291\u2013307 (2005)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s00446-011-0129-5","volume":"24","author":"R Kleinberg","year":"2011","unstructured":"Kleinberg, R., Piliouras, G., Tardos, \u00c9.: Load balancing without regret in the bulletin board model. Distrib. Comput. 24(1), 21\u201329 (2011)","journal-title":"Distrib. Comput."},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Krichene, W., Drigh\u00e8s, B., Bayen, A.M.: Learning Nash equilibria in congestion games. arXiv preprint arXiv:1408.0017 (2014)","DOI":"10.1137\/140980685"},{"issue":"1","key":"20_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.A.: On information and sufficiency. Ann. Math. Stat. 22(1), 79\u201386 (1951)","journal-title":"Ann. Math. Stat."},{"issue":"6","key":"20_CR18","doi-asserted-by":"publisher","first-page":"2666","DOI":"10.1016\/j.jet.2013.08.002","volume":"148","author":"R Laraki","year":"2013","unstructured":"Laraki, R., Mertikopoulos, P.: Higher order game dynamics. J. Econ. Theory 148(6), 2666\u20132695 (2013)","journal-title":"J. Econ. Theory"},{"issue":"2","key":"20_CR19","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Inf. Comput. 108(2), 212\u2013261 (1994)","journal-title":"Inf. Comput."},{"issue":"4","key":"20_CR20","doi-asserted-by":"publisher","first-page":"1359","DOI":"10.1214\/09-AAP651","volume":"20","author":"P Mertikopoulos","year":"2010","unstructured":"Mertikopoulos, P., Moustakas, A.L.: The emergence of rational behavior in the presence of stochastic perturbations. Ann. Appl. Probab. 20(4), 1359\u20131388 (2010)","journal-title":"Ann. Appl. Probab."},{"issue":"4","key":"20_CR21","doi-asserted-by":"publisher","first-page":"1297","DOI":"10.1287\/moor.2016.0778","volume":"41","author":"P Mertikopoulos","year":"2016","unstructured":"Mertikopoulos, P., Sandholm, W.H.: Learning in games via reinforcement and regularization. Math. Oper. Res. 41(4), 1297\u20131324 (2016)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"20_CR22","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1145\/2806883","volume":"62","author":"T Roughgarden","year":"2015","unstructured":"Roughgarden, T.: Intrinsic robustness of the price of anarchy. J. ACM (JACM) 62(5), 32 (2015)","journal-title":"J. ACM (JACM)"},{"key":"20_CR23","series-title":"Economic Learning and Social Evolution","volume-title":"Population Games and Evolutionary Dynamics","author":"WH Sandholm","year":"2010","unstructured":"Sandholm, W.H.: Population Games and Evolutionary Dynamics. Economic Learning and Social Evolution. MIT Press, Cambridge (2010)"},{"key":"20_CR24","unstructured":"Syrgkanis, V., Agarwal, A., Luo, H., Schapire, R.E.: Fast convergence of regularized learning in games. In: Advances in Neural Information Processing Systems, pp. 2989\u20132997 (2015)"},{"issue":"1","key":"20_CR25","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s40505-014-0062-4","volume":"3","author":"Y Viossat","year":"2015","unstructured":"Viossat, Y.: Evolutionary dynamics and dominated strategies. Econ. Theory Bull. 3(1), 91\u2013113 (2015)","journal-title":"Econ. Theory Bull."},{"issue":"2","key":"20_CR26","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1016\/j.jet.2012.07.003","volume":"148","author":"Y Viossat","year":"2013","unstructured":"Viossat, Y., Zapechelnyuk, A.: No-regret dynamics and fictitious play. J. Econ. Theory 148(2), 825\u2013842 (2013)","journal-title":"J. Econ. Theory"},{"key":"20_CR27","first-page":"371","volume-title":"Colt Proceedings 1990","author":"Volodimir G. Vovk","year":"1990","unstructured":"Vovk, V.G.: Aggregating strategies. In: COLT 1990: Proceedings of the 3rd Workshop on Computational Learning Theory, pp. 371\u2013383 (1990)"},{"key":"20_CR28","volume-title":"Evolutionary Game Theory","author":"JW Weibull","year":"1995","unstructured":"Weibull, J.W.: Evolutionary Game Theory. MIT Press, Cambridge (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Game Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66700-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:27:20Z","timestamp":1709828840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-66700-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319666990","9783319667003"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66700-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"19 August 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAGT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmic Game Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"L'Aquila","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sagt2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.gssi.infn.it\/sagt2017","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}