This paper proposes a game-theory based approach in a multi–target searching using a multi-robot system in a dynamic environment. It is assumed that a rough priori probability map of the targets’ distribution within the environment is given. To consider the interaction between the robots, a dynamic-programming equation is proposed to estimate the utility function for each robot. Based on this u...

The paper proposes a framework to extend regret theory to dynamic contexts. The key idea is to conceive of a dynamic decision problem with regret as an intra-personal game in which the agent forms conjectures about the behaviour of the various counterfactual selves that he could have been. We derive behavioural implications in situations in which payoffs are correlated across either time or con...

We consider classes of cooperative games. We show that we can eeciently compute an allocation in the intersection of the prekernel and the least core of the game if we can eeciently compute the minimum excess for any given allocation. In the case where the prekernel of the game contains exactly one core vector, our algorithm computes the nucleolus of the game. This generalizes both a recent res...

We consider classes of TU-games. We show that we can efficiently compute an allocation in the intersection of the prekernel and the least core of the game if we can efficiently compute the minimum excess for any given allocation. In the case where the prekernel of the game contains exactly one core vector, our algorithm computes the nucleolus of the game. This generalizes both a recent result b...

Purpose: The aim of this study was to compare the effectiveness of Fernaldchr(chr('39')39chr('39'))s multisensory training and computer game training on dyslexia in primary school students with learning disabilities in Ahvaz. Methodology: This study was applied in terms of purpose and in an experimental framework (pre-test-post-test design with control group). The statistical population in the...

We consider a zero-sum stopping game (Dynkin’s game) with a threshold probability criterion in discrete time stochastic processes. We first obtain fundamental characterization of value function of the game and optimal stopping times for both players as the result of the classical Dynkin’s game, but the value function of the game and the optimal stopping time for each player depend upon a thresh...