Randomness for Free
نویسندگان
چکیده
We consider two-player zero-sum games on graphs. These games can be classified on the basis of the information of the players and on the mode of interaction between them. On the basis of information the classification is as follows: (a) partial-observation (both players have partial view of the game); (b) one-sided complete-observation (one player has complete observation); and (c) complete-observation (both players have complete view of the game). On the basis of mode of interaction we have the following classification: (a) concurrent (players interact simultaneously); and (b) turn-based (players interact in turn). The two sources of randomness in these games are randomness in transition function and randomness in strategies. In general, randomized strategies are more powerful than deterministic strategies, and randomness in transitions gives more general classes of games. We present a complete characterization for the classes of games where randomness is not helpful in: (a) the transition function (probabilistic transition can be simulated by deterministic transition); and (b) strategies (pure strategies are as powerful as randomized strategies). As consequence of our characterization we obtain new undecidability results for these games.
منابع مشابه
A Randomness Test for Stable Data
In this paper, we propose a new method for checking randomness of non-Gaussian stable data based on a characterization result. This method is more sensitive with respect to non-random data compared to the well-known non-parametric randomness tests.
متن کاملTESTING FOR “RANDOMNESS” IN SPATIAL POINT PATTERNS, USING TEST STATISTICS BASED ON ONE-DIMENSIONAL INTER-EVENT DISTANCES
To test for “randomness” in spatial point patterns, we propose two test statistics that are obtained by “reducing” two-dimensional point patterns to the one-dimensional one. Also the exact and asymptotic distribution of these statistics are drawn.
متن کاملHyperimmune-free degrees and Schnorr triviality
We investigate the relationship between lowness for Schnorr randomness and Schnorr triviality. We show that a real is low for Schnorr randomness if and only if it is Schnorr trivial and hyperimmune free.
متن کاملRamdom Reals and Possibly Infinite Computations. Part I: Randomness in ∅′ Verónica Becher and Serge Grigorieff
Using possibly infinite computations on universal monotone Turing machines, we prove Martin-Löf randomness in ∅′ of the probability that the output be in some set O ⊆ 2≤ω under complexity assumptions about O. §1. Randomness in the spirit of Rice’s theorem for computability. Let 2∗ be the set of all finite strings in the binary alphabet 2 = {0, 1}. Let 2ω be the set of all infinite binary sequen...
متن کاملOn spin systems with quenched randomness: Classical and quantum
The rounding of first-order phase transitions by quenched randomness is stated in a form which is applicable to both classical and quantum systems: The free energy, as well as the ground state energy, of a spin system on a d-dimensional lattice is continuously differentiablewith respect to anyparameter in theHamiltonian towhich some randomness has been added when d ≤ 2. This implies absence of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Comput.
دوره 245 شماره
صفحات -
تاریخ انتشار 2010