{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:11:39Z","timestamp":1725754299770},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319027852"},{"type":"electronic","value":"9783319027869"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-02786-9_5","type":"book-chapter","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T10:29:21Z","timestamp":1383128961000},"page":"65-84","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Regret Minimization in Bounded-Memory Games"],"prefix":"10.1007","author":[{"given":"Jeremiah","family":"Blocki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Christin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anupam","family":"Datta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arunesh","family":"Sinha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Blum, A., Mansour, Y.: Learning, regret minimization, and equilibria. Algorithmic Game Theory, 79\u2013102 (2007)","DOI":"10.1017\/CBO9780511800481.006"},{"issue":"10","key":"5_CR2","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1073\/pnas.39.10.1095","volume":"39","author":"L. Shapley","year":"1953","unstructured":"Shapley, L.: Stochastic games. Proceedings of the National Academy of Sciences of the United States of America\u00a039(10), 1095 (1953)","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"key":"5_CR3","unstructured":"Blocki, J., Christin, N., Datta, A., Sinha, A.: Adaptive regret minimization in bounded-memory games. CoRR abs\/1111.2888 (2011)"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Blocki, J., Christin, N., Datta, A., Sinha, A.: Regret minimizing audits: A learning-theoretic basis for privacy protection. In: 24th IEEE Computer Security Foundations Symposium, CSF 2011, pp. 312\u2013327. IEEE (2011)","DOI":"10.1109\/CSF.2011.28"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-642-34266-0_3","volume-title":"Decision and Game Theory for Security","author":"J. Blocki","year":"2012","unstructured":"Blocki, J., Christin, N., Datta, A., Sinha, A.: Audit mechanisms for provable risk management and accountable data governance. In: Grossklags, J., Walrand, J. (eds.) GameSec 2012. LNCS, vol.\u00a07638, pp. 38\u201359. Springer, Heidelberg (2012)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Von Stackelberg, H.: Market structure and equilibrium. Springer (2011)","DOI":"10.1007\/978-3-642-12586-7"},{"key":"5_CR7","unstructured":"Blocki, J., Christin, N., Datta, A., Procaccia, A.D., Sinha, A.: Audit games. In: IJCAI (2013)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Tambe, M.: Security and Game Theory: Algorithms, Deployed Systems, Lessons Learned. Cambridge University Press (2011)","DOI":"10.1109\/Allerton.2012.6483443"},{"issue":"2","key":"5_CR9","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/BF01769259","volume":"10","author":"J. Mertens","year":"1981","unstructured":"Mertens, J., Neyman, A.: Stochastic games. International Journal of Game Theory\u00a010(2), 53\u201366 (1981)","journal-title":"International Journal of Game Theory"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Tsitsiklis, J.: The complexity of optimal queueing network control (1999)","DOI":"10.1287\/moor.24.2.293"},{"key":"5_CR11","unstructured":"Golovin, D., Krause, A.: Adaptive submodularity: A new approach to active learning and stochastic optimization. CoRR abs\/1003.3967 (2010)"},{"key":"5_CR12","unstructured":"Even-Dar, E., Kakade, S., Mansour, Y.: Experts in a Markov decision process. In: Advances in Neural Information Processing Systems 17: Proceedings of the 2004 Conference, p. 401. The MIT Press (2005)"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Mannor, S., Shimkin, N.: The empirical bayes envelope and regret minimization in competitive markov decision processes. Mathematics of Operations Research, 327\u2013345 (2003)","DOI":"10.1287\/moor.28.2.327.14483"},{"key":"5_CR14","unstructured":"Even-Dar, E., Mannor, S., Mansour, Y.: Learning with global cost in stochastic environments. In: COLT: Proceedings of the Workshop on Computational Learning Theory (2010)"},{"key":"5_CR15","first-page":"773","volume":"4","author":"E. Takimoto","year":"2003","unstructured":"Takimoto, E., Warmuth, M.: Path kernels and multiplicative updates. The Journal of Machine Learning Research\u00a04, 773\u2013818 (2003)","journal-title":"The Journal of Machine Learning Research"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jcss.2007.04.016","volume":"74","author":"B. Awerbuch","year":"2008","unstructured":"Awerbuch, B., Kleinberg, R.: Online linear optimization and adaptive routing. Journal of Computer and System Sciences\u00a074(1), 97\u2013114 (2008)","journal-title":"Journal of Computer and System Sciences"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/1183907.1183911","volume":"53","author":"D.P.D. Farias","year":"2006","unstructured":"Farias, D.P.D., Megiddo, N.: Combining expert advice in reactive environments. J. ACM\u00a053, 762\u2013799 (2006)","journal-title":"J. ACM"},{"key":"5_CR18","unstructured":"Fudenberg, D., Tirole, J.: Game theory. MIT Press (1991)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Blum, A., Mansour, Y.: From external to internal regret. Learning Theory, 621\u2013636 (2005)","DOI":"10.1007\/11503415_42"},{"key":"5_CR20","doi-asserted-by":"publisher","first-page":"691","DOI":"10.2307\/2171867","volume":"64","author":"M. Celentani","year":"1996","unstructured":"Celentani, M., Fudenberg, D., Levine, D., Pesendorfer, W.: Maintaining a reputation against a patient opponent. Econometrica\u00a064, 691\u2013704 (1996)","journal-title":"Econometrica"},{"issue":"2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-sat. Journal of Computer and System Sciences\u00a062(2), 367\u2013375 (2001)","journal-title":"Journal of Computer and System Sciences"},{"issue":"4","key":"5_CR22","doi-asserted-by":"publisher","first-page":"798","DOI":"10.1145\/502090.502098","volume":"48","author":"J. Hastad","year":"2001","unstructured":"Hastad, J.: Some optimal inapproximability results. Journal of the ACM (JACM)\u00a048(4), 798\u2013859 (2001)","journal-title":"Journal of the ACM (JACM)"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1112\/jlms\/s1-21.3.167","volume":"1","author":"I.J. Good","year":"1946","unstructured":"Good, I.J.: Normal recurring decimals. Journal of the London Mathematical Society\u00a01(3), 167 (1946)","journal-title":"Journal of the London Mathematical Society"},{"key":"5_CR24","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.: Gambling in a rigged casino: The adversarial multi-armed bandit problem. In: FOCS, p. 322. IEEE Computer Society (1995)"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Littlestone, N., Warmuth, M.: The weighted majority algorithm. In: Proceedings of FOCS, pp. 256\u2013261 (1989)","DOI":"10.1109\/SFCS.1989.63487"}],"container-title":["Lecture Notes in Computer Science","Decision and Game Theory for Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02786-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T01:59:35Z","timestamp":1558663175000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-02786-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319027852","9783319027869"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02786-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}