کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
5072603 1373510 2008 32 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Regret minimization in repeated matrix games with variable stage duration
موضوعات مرتبط
علوم انسانی و اجتماعی اقتصاد، اقتصادسنجی و امور مالی اقتصاد و اقتصادسنجی
پیش نمایش صفحه اول مقاله
Regret minimization in repeated matrix games with variable stage duration
چکیده انگلیسی
Regret minimization in repeated matrix games has been extensively studied ever since Hannan's seminal paper [Hannan, J., 1957. Approximation to Bayes risk in repeated play. In: Dresher, M., Tucker, A.W., Wolfe, P. (Eds.), Contributions to the Theory of Games, vol. III. Ann. of Math. Stud., vol. 39, Princeton Univ. Press, Princeton, NJ, pp. 97-193]. Several classes of no-regret strategies now exist; such strategies secure a long-term average payoff as high as could be obtained by the fixed action that is best, in hindsight, against the observed action sequence of the opponent. We consider an extension of this framework to repeated games with variable stage duration, where the duration of each stage may depend on actions of both players, and the performance measure of interest is the average payoff per unit time. We start by showing that no-regret strategies, in the above sense, do not exist in general. Consequently, we consider two classes of adaptive strategies, one based on Blackwell's approachability theorem and the other on calibrated play, and examine their performance guarantees. We further provide sufficient conditions for existence of no-regret strategies in this model.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Games and Economic Behavior - Volume 63, Issue 1, May 2008, Pages 227-258
نویسندگان
, ,