In this paper, we introduce a notion of “epistemic action” to describe changes in the information states of the players in a game. For this, we use ideas that we have developed in our previous papers [BMS], [BMS2] and [B], enriching them to cover, not just purely epistemic actions, but also fact-changing actions (“real moves”, e.g. choosing a card, exchanging cards etc.) and nondeterministic ac...

This article considers a two-person game in which the first player has access to certain information that is valuable but unknown to the second player. The first player can distort the information before it is passed on to the second player. The purpose in distorting the information is to render it as useless as possible to the second player. Based o n the distorted information received, the se...

Harsanyi’s work on games with incomplete information is by use of probabilistic approach and constitutes one of the most important developments in game theory. This paper presents a spectrum of credibilistic game, in which the incomplete information is interpreted as fuzzy variables and processed via credibilistic approach. As the leadoff, a strategic game with fuzzy payoffs is discussed by pre...

A General Game Player is a system that can play previously unknown games given nothing but their rules. The Game Description Language (GDL) has been developed as a highlevel knowledge representation formalism for axiomatising the rules of any game, and a basic requirement of a General Game Player is the ability to reason logically about a given game description. In this paper, we address the fu...

This paper discusses a case study of the board game of Scotland Yard from a computational perspective. Interestingly, Scotland Yard is a genuine “playgame” with imperfect information. For reasons not completely clear to me, games with imperfect information have escaped the interest of researchers in Algorithmic combinatorial gametheory. I show by means of a powerset argument, that Scotland Yard...

This paper formulates and solves the robust H∞ control problem for discrete time nonlinear switching systems. The H∞ control problem is interpreted as the l2 finite gain control problem and is studied using a dissipative systems theory for switched systems. Both state and measurement feedback control problems are formulated as dynamic games and solved using dynamic programming. The partially ob...