Abstract We consider a real-valued function f defined on the set of infinite branches X countably branching pruned tree T . The is said to be limsup if there $u \colon \to \mathbb {R}$ such that $f(x) = \limsup _{t \infty } u(x_{0},\dots ,x_{t})$ for each $x \in X$ study game characterization functions, as well novel functions Baire class 1.

Background and Objectives: One of the main concerns of hospital managers is their ability in improving their organization's performance. The use of quality management and decision-making techniques facilitates managers to achieve this goal. In this research, the corrective activities to increase the quality of hospital services are determined and selected using an integration o...

In a three-dimensional (3D) world most saccades are made towards visual targets that are located at different distances. We previously demonstrated that gaze shifts within 3D space consist of two stages: a target saccade followed by a corrective saccade during gaze fixation that directs the eyes to the physical target location. We proposed that, by accurately positioning the eyes on the visual ...

In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...

We prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokémon. Our results apply to generalized versions of Super Mario Bros. 1–3, The Lost Levels, and Super Mario World; Donkey Kong Country 1–3; all Legend of Zelda games; all Metroid games; and all Pokémon role-playing games. In addition, we prove PSPACE-completenes...

In this paper we study the complexity of finding approximate Nash equilibria in multi-player normal-form games. First, for any constant number n, we present a polynomial-time algorithm for computing a relative ( 1− 1 1+(n−1)n ) -Nash equilibrium in arbitrary nplayer games and a relative ( 1− 1 1+(n−1)n−1 ) -Nash equilibrium in symmetric n-player games. Next, we show that there is an additive ε-...