The turnpike property for dynamic discrete time zero-sum games

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Turnpike Property for Dynamic Discrete Time Zero-sum Games

We consider a class of dynamic discrete-time two-player zero-sum games. We show that for a generic cost function and each initial state, there exists a pair of overtaking equilibria strategies over an infinite horizon. We also establish that for a generic cost function f , there exists a pair of stationary equilibria strategies (xf ,yf ) such that each pair of “approximate” equilibria strategie...

متن کامل

Two Player Non Zero-sum Stopping Games in Discrete Time

We prove that every two player non zero-sum stopping game in discrete time admits an -equilibrium in randomized strategies, for every > 0. We use a stochastic variation of Ramsey Theorem, which enables us to reduce the problem to that of studying properties of -equilibria in a simple class of stochastic games with finite state space.

متن کامل

Approximations in Dynamic Zero-sum Games, Ii Approximations in Dynamic Zero-sum Games, Ii

We pursue in this paper our study of approximations of values and-saddle-point policies in dynamic zero-sum games. After extending the general theorem for approximation, we study zero-sum stochastic games with countable state space, and non-bounded immediate reward. We focus on the expected average payoo criterion. We use some tools developed in the rst paper, to obtain the convergence of the v...

متن کامل

Information Relaxations and Dynamic Zero-Sum Games

Dynamic zero-sum games are an important class of problems with applications ranging from evasion-pursuit and heads-up poker to certain adversarial versions of control problems such as multi-armed bandit and multiclass queuing problems. These games are generally very difficult to solve even when one player’s strategy is fixed, and so constructing and evaluating good sub-optimal policies for each...

متن کامل

Approximations in Dynamic Zero-sum Games

We develop a unifying approach for approximating a “limit" zero-sum game by a sequence of approximating games. We discuss both the convergence of the values and the convergence of optimal (or “almost" optimal) strategies. Moreover, based on optimal policies for the limit game, we construct policies which are almost optimal for the approximating games. We then apply the general framework to stat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Abstract and Applied Analysis

سال: 1999

ISSN: 1085-3375,1687-0409

DOI: 10.1155/s1085337599000020