Borel stay-in-a-set games

نویسندگان

  • Ashok P. Maitra
  • William D. Sudderth
چکیده

Consider an n-person stochastic game with Borel state space S, compact metric action sets A 1 , A 2 ,. .. , A n , and law of motion q such that the integral under q of every bounded Borel measurable function depends measurably on the initial state x and continuously on the actions (a 1 , a 2 ,. .. , a n) of the players. If the payoff to each player i is 1 or 0 according to whether or not the stochastic process of states stays forever in a given Borel set G i , then there is an-equilibrium for every > 0.

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

ثبت نام

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

منابع مشابه

A pr 1 99 6 Blackwell Games 1 Blackwell Games

Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves and are then informed of each other’s moves. Payoff is determined by a Borel measurable function f on the set of possible resulting sequences of moves. A standard result in Game Theory is that finite games of this type are determined. Blackwell proved that infinite games are determined, ...

متن کامل

Blackwell Games

Blackwell games are infinite games of imperfect information. The two players simultaneously make their moves and are then informed of each other’s moves. Payoff is determined by a Borel measurable function f on the set of possible resulting sequences of moves. A standard result in Game Theory is that finite games of this type are determined. Blackwell proved that infinite games are determined, ...

متن کامل

The Complexity of Recursion Theoretic Games

We show that some natural games introduced by Lachlan in 1970 as a model of recursion theoretic constructions are undecidable, contrary to what was previously conjectured. Several consequences are pointed out; for instance, the set of all Π2-sentences that are uniformly valid in the lattice of recursively enumerable sets is undecidable. Furthermore we show that these games are equivalent to nat...

متن کامل

Games with Winning Conditions of High Borel Complexity

We first consider infinite two-player games on pushdown graphs. In previous work, Cachat, Duparc and Thomas [4] have presented a winning decidable condition that is Σ3-complete in the Borel hierarchy. This was the first example of a decidable winning condition of such Borel complexity. We extend this result by giving a family of decidable winning conditions of arbitrary finite Borel complexity....

متن کامل

A Determinacy Approach to Borel Combinatorics

We introduce a new method, involving infinite games and Borel determinacy, which we use to answer several well-known questions in Borel combinatorics.

متن کامل

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


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

عنوان ژورنال:
  • Int. J. Game Theory

دوره 32  شماره 

صفحات  -

تاریخ انتشار 2003