# Subjective Rationalizability in Hypergames

Authors: Yasuo Sasaki
Journal: Advances in Decision Sciences
 (2014)

---

## Abstract

A new solution concept for hypergames called subjective rationalizability is proposed. Hypergame theory is a game theoretical framework that deals with agents who may misperceive game structures and explicitly takes into account hierarchy of perceptions, that is, an agent’s view about another agent’s view and so on. An action of an agent is called subjectively rationalizable when the agent thinks it can be a best response to the other’s choices, each of which the agent thinks each agent thinks is a best response to the other’s choices, and so on. Then it is proved that subjective rationalizability is equivalent to the standard notion of rationalizability under a condition called inside common knowledge. The result makes the new solution concept a practical tool in hypergame analyses. Theoretically, it is characterized as such a concept that provides the precise implication, that is, predicted outcomes, of a given hypergame structure.


---

## Body

## 1. Introduction

Hypergame theory deals with misperceptions of agents (decision makers) in games by relaxing common knowledge often assumed in the standard game theory [1, 2]. It is the basic idea of hypergames that each agent is supposed to possess independently a subjective view about a game called her subjective game and make a decision based on it. The idea allows agents to hold different perceptions and thus enables us to capture realistic aspects of many interactive decision making situations given that misperceptions are everyday affairs in our life.In game theory, Bayesian games are often referred to as the standard model to deal with incomplete information [3]. While a hypergame can technically be reformulated as a Bayesian game under specific conditions, the reformulation requires the agents to be aware of every possibility indeed relevant to the situation [4]. Therefore hypergames are unique in that they can directly deal with unawareness of agents.Although hypergame theory has been developed in several ways, the framework the present study deals with explicitly takes into account hierarchy of perceptions, that is, an agent’s view about another agent’s view and so on [5–8]. It can describe not only situations in which an agent may perceive a game differently from the others but also situations in which she may notice that other agents may perceive the game differently, and moreover the other agents may also notice that the other agents may see different games and so on. Such a hierarchy of perceptions is formalized by using the concept of viewpoint. For example, agent i’s view about agent j’s view about agent k’s view about a game is modeled as the subjective game of viewpoint k
j
i. In this paper, we simply refer to this type of hypergame model as a hypergame. Then a hypergame is defined as the collection of subjective games for all the viewpoints.In order to predict an agent’s choice in one-shot hypergame, that is, a hypergame played only once, several solution concepts have been proposed [8]. They are typically based on the following idea. First, an analyzer fixes the level of hierarchy of perceptions and finds out an “equilibrium” (e.g., Nash equilibrium) in the subjective games of the lowest level of the hierarchy. Then it is supposed that best responses are taken sequentially at each level. For example, consider a two-level hypergame played by two agents, i and j. According to the idea, in order to analyze agent i’s choice, we first need to know an equilibrium in the subjective game of viewpoint j
i. If agent j’s some action constitutes an equilibrium there, then, expecting agent j would take the action, agent i chooses a best response to it in viewpoint i’s subjective game (see an example in Section 5).There are at least two problems of the idea. First, it is not clear what assures that an agent takes an action that constitutes an equilibrium [9]. Rather, it has been shown that the precise implication of common knowledge of the game structure and rationality of the agents is rationalizability, a weaker concept than Nash equilibrium [10]. Second, there seems to be no substantial reason that we can fix the finite level of a hypergame. In the example above, agent j’s choice in viewpoint j
i’s subjective game would depend on agent j’s expectation about agent i’s choice, which clearly depends on how agent j thinks how agent i perceives the game. Therefore it seems that we need to consider viewpoint i
j
i’s subjective game and so on.In this paper, addressing these issues, we explore the possibility of extending the notion of rationalizability to hypergames so as to examine the precise prediction of an agent’s choice in a hypergame. We consider an infinite hierarchy and suppose that agents act according to the following principle as an analogy of rationalizability: an agent takes a best response to actions of the others, each of which the agent thinks each agent thinks is a best response to actions of the others, and so on. If an agent’s action satisfies the principle under a given hierarchy of perceptions, it is called subjectively rationalizable. Subjective rationalizability is defined not for agents but for viewpoints, so, for instance, agenti can think of agent j’s choice as viewpoint j
i’s subjectively rationalizable action. Then agent i’s choice can be predicted as viewpoint i’s subjectively rationalizable action; thus we also call this the agent’s subjectively rationalizable action. Hence, possible outcomes of a hypergame are given as any combinations of each agent’s subjectively rationalizable action. Note that, throughout the paper, we distinguish clearly between “subjective rationalizability” and “rationalizability.”Subjective rationalizability, however, is apparently impractical because it requires us to calculate each agent’s choice at each level in an infinite hierarchy of perceptions. We, however, prove that, under a condition called inside common knowledge [6], subjective rationalizability is equivalent to rationalizability and show that an agent’s subjectively rationalizable action can be easily derived by applying the result. Here a particular viewpoint is said to have inside common knowledge when the viewpoint considers that the game structure is common knowledge. In general, something is called common knowledge if everyone knows it, everyone knows everyone knows it, and so on.Following the introduction, we introduce the hypergame framework in Section2 and subjective rationalizability in Section 3 and examine a relationship between subjective rationalizability and rationalizability in Section 4. Then, we discuss its implication with an example case in Section 5 and finally add a conclusion.


## 2. Hypergame Model

The theoretical basis of hypergames is normal form game, which is defined as follows.Definition 1 (normal form games).
G
=
(
I
,
A
,
u
) is anormal form game, where(i)
Iis the (nonempty) set ofagents;
(ii)
A
=
×
i
∈
I
A
i, where A
i is the (nonempty) set of agent i’sactions; a
∈
A is called anoutcome (we do not deal with mixed extension of games in this paper);
(iii)
u
=
(
u
i
)
i
∈
I, where u
i
:
A
→
R is agent i’sutility function.In a hypergame, each agent is assumed to have her own subjective view about the game she faces. The framework explicitly takes into account hierarchy of perceptions, that is, an agent’s perception about another agent’s perception and so on, by introducing the concept of viewpoints (in the literature, the concept of viewpoint may be described in the form of strings of agents [6, 8]; in particular, our definition of relevant viewpoints as well as the concept of their concatenations introduced in this section is mostly based on [6]). For example, viewpoint i means agent i’s view, and viewpoint j
i is agent j’s view perceived by agent i. In general, viewpoint i
1
i
2
⋯
i
n is interpreted as agent i
1’s view perceived by agent i
2
⋯ perceived by agent i
n. Each perception of each viewpoint is given as a normal form game and called the viewpoint’s subjective game. An example of a hypergame is presented in Section 5.Definition 2 (hypergames).
H
=
(
I
,
(
G
σ
)
σ
∈
Σ
) is ahypergame, where I is the finite set of agents involved in the situation and Σ is the set ofviewpoints relevant to it. For any σ
∈
Σ, G
σ
=
(
I
σ
,
A
σ
,
u
σ
) is a normal form game called viewpoint σ’ssubjective game, where(i)
I
σ is the (nonempty) set of agents perceived by viewpoint σ;
(ii)
A
σ
=
×
i
∈
I
σ
A
i
σ, where A
i
σ is the (nonempty) set of agent i’s actions perceived by viewpoint σ;
(iii)
u
σ
=
(
u
i
σ
)
i
∈
I
σ, where u
i
σ
:
A
σ
→
R is agent i’s utility function perceived by viewpoint σ.ThenΣ is defined as Σ
=
I
∪
⋃
n
=
2
∞
‍
{
i
1
⋯
i
n
∣
i
n
∈
I, i
k
-
1
∈
I
i
k
⋯
i
n
∖
{
i
k
} for any k
(
=
2
,
…
,
n
)
}.Although the hypergame literature usually does not put any restrictions on the set of viewpoints, we exclude “unnatural” ones by specifying the set of viewpointsrelevant to a hypergame and consider only these viewpoints. A viewpoint is said to be relevant when it is actually taken into account in some agent’s decision making. We assume that, in a hypergame, any viewpoint σ, when formulating the decision situation, considers views of all the agents whom σ thinks are participating in the game and does not consider views of anybody else. For example, when agent i is in I, i
∈
Σ by definition, and if another agent j is in I
i, viewpoint j
i must be in Σ; otherwise, it is not included in Σ. Furthermore, we suppose that a viewpoint does not contain any successive agents. For example, since considering agent i’s view perceived by agent i is redundant, we do not consider viewpoint i
i; that is, i
i
∉
Σ; similarly, neither j
i
i nor i
i
j is included in Σ. In the subsequent discussion, when we refer to viewpoints, we only indicate viewpoints relevant in this sense.We deal with concatenations of viewpoints. For example, byσ
′
σ with σ
=
i
1
⋯
i
n and σ
′
=
j
1
⋯
j
m (with j
m
≠
i
1) we mean viewpoint j
1
⋯
j
m
i
1
⋯
i
n. When σ
=
i
1
⋯
i
n with n
≥
2, any viewpoint i
m
⋯
i
n with n
≥
m
≥
2 is said to behigher than σ. On the other hand, any viewpoint τ
σ with τ
=
j
1
⋯
j
l and j
l
≠
i
1 is said to belower than σ. For example, for viewpoint j
i, viewpoint i is higher than j
i while viewpoint k
j
i is lower than it. Furthermore, for σ
=
i
1
⋯
i
n, let us denote i
1 by σ
1. We say σ
1 is thelowest agent in viewpoint σ and naturally assume σ
1
∈
I
σ for any σ
∈
Σ; that is, the lowest agent is always included in the agent set in any viewpoint’s subjective game. For any σ
∈
Σ, let Σ
σ
=
{
σ
}
∪
{
τ
σ
∣
τ
=
j
1
⋯
j
l
,
j
l
≠
σ
1, and τ
σ
∈
Σ
}. Σ
σ is the union of σ itself and the set of viewpoints lower than σ.


## 3. Subjective Rationalizability

We define a new solution concept for hypergames, subjective rationalizability, as follows. (Note that, in Definition3, a
σ
* is a particular action of σ
1, the lowest agent of viewpoint σ.)Definition 3 (subjective rationalizability).
LetH
=
(
I
,
(
G
σ
)
σ
∈
Σ
) be a hypergame. a
σ
*
∈
A
σ
1
σ is calledsubjectively rationalizable for viewpoint σ if and only if there exists (
a
τ
*
)
τ
∈
Σ
σ in ×
τ
∈
Σ
σ
A
τ
1
τ which satisfies τ
∀
∈
Σ
σ, a
∀
τ
∈
A
τ
1
τ, u
τ
1
τ
(
a
τ
*
,
a
-
τ
*
)
≥
u
τ
1
τ
(
a
τ
,
a
-
τ
*
), where a
-
τ
*
=
(
a
i
τ
*
)
i
∈
I
τ
∖
{
τ
1
}. Then such (
a
τ
*
)
τ
∈
Σ
σ is called abest response hierarchy of Σ
σ.An action of the lowest agent in a viewpoint is called subjectively rationalizable for the viewpoint when it is a best response in the viewpoint’s subjective game to some actions of the other agents, each of which is a best response in the subjective game of one-step lower viewpoint to some actions of the other agents, and so on. The concept of subjective rationalizability can be understood based on the following principle. The lowest agent in a viewpoint would take a best response to actions which she thinks the other agents would choose. When expecting the choices of the others, she considers that each of the other agents takes a best response to actions which she thinks the agent thinks the other agents would choose, and her inference goes on for further lower viewpoints. When agenti makes a decision in this way, her choice can be predicted as a subjectively rationalizable action of viewpoint i. Thus we may also say it isagent
i’s subjectively rationalizable action.For example, let us see Figure1 and consider how agent i decides her choice according to the principle. In the figure, a circled letter indicates an agent and each arrow describes each agent’s perception. Suppose agent i considers agents 1
,
…
,
m are participating in the game, and each of them is going to choose a
1
i
*
,
…, and a
m
i
*, respectively because each of them takes a best response to such actions that agent i thinks each agent considers the other agents are going to choose. For example, agent i expects agent 1 to take a
1
i
*, which is a best response in viewpoint 1
i’s subjective game to (
a
21
i
*
,
…
,
a
n
1
i
*
), actions of the other agents who are in the game in agent 1’s subjective game perceived by agent i. Furthermore, agent i considers agent 1 thinks the others are going to choose (
a
21
i
*
,
…
,
a
n
1
i
*
) because agent i thinks agent 1 thinks each of the other agents takes a best response to such actions that agent i thinks agent 1 thinks each agent expects the other agents to choose, and so on. Then agent i takes a
i
*, a best response in her own subjective game to (
a
1
i
*
,
…
,
a
m
i
*
): a
i
* is her subjectively rationalizable action. As a result, the actions depicted in the squares in the figure constitute a best response hierarchy: each action is a best response in the viewpoint’s subjective game to the actions described in the one-step lower layer. Therefore, by definition, each action is subjectively rationalizable for each viewpoint.Figure 1
Subjective rationalizability.An outcome likely to obtain as a result of each agent’s decision making in this way is thus given as a combination of each agent’s subjectively rationalizable action. Note that, given that a viewpoint’s subjective game may contain some misperceptions, a subjectively rationalizable action may not be a best response to the others’ actual choices from an objective (an analyzer’s) point of view, and hence it is called “subjectively” rationalizable (see an example in Section5).We note that, in general, a viewpoint may not have any subjectively rationalizable actions. However, the next proposition assures the existence of a subjectively rationalizable action under a natural assumption on the hypergame structure.Proposition 4.
In a hypergameH
=
(
I
,
(
G
σ
)
σ
∈
Σ
), for any σ
∈
Σ, if, for any τ
∈
Σ
σ, i
∀
∈
I
τ
∖
{
τ
1
}, A
i
i
τ
⊆
A
i
τ, then σ has at least one subjectively rationalizable action.Proof.
LetH
=
(
I
,
(
G
σ
)
σ
∈
Σ
) be a hypergame and suppose, for a particular viewpoint σ
∈
Σ, for any τ
∈
Σ
σ,i
∀
∈
I
τ
∖
{
τ
1
}
,
A
i
i
τ
⊆
A
i
τ (note that A
i
i
τ is defined because i
∈
I
i
τ is assumed in any case and nonempty according to Definition 2). This implies, for any τ
∈
Σ
σ, for any a
-
τ
∈
×
i
∈
I
τ
∖
{
τ
1
}
A
i
i
τ, a
-
τ is included in ×
i
∈
I
τ
∖
{
τ
1
}
A
i
τ; hence there exists a
τ
′
∈
A
τ
1
τ such that for any a
τ
∈
A
τ
1
τ, u
τ
1
τ
(
a
τ
′
,
a
-
τ
)
≥
u
τ
1
τ
(
a
τ
,
a
-
τ
), that is, τ
1’s best response to a
-
τ in G
τ. This implies the existence of a best response hierarchy of Σ
σ; that is, there exists (
a
τ
*
)
τ
∈
Σ
σ such that a
τ
*
∈
A
τ
1
τ for all τ
∈
Σ
σ which satisfies τ
∀
∈
Σ
σ, a
∀
τ
∈
A
τ
1
τ, u
τ
1
τ
(
a
τ
*
,
a
-
τ
*
)
≥
u
τ
1
τ
(
a
τ
,
a
-
τ
*
), where a
-
τ
*
=
(
a
i
τ
*
)
i
∈
I
τ
∖
{
τ
1
}. Such a
σ
*
∈
A
σ
1
σ in (
a
τ
*
)
τ
∈
Σ
σ is σ’s subjectively rationalizable action.The proposition describes the sufficient condition of the existence of subjectively rationalizable action for a particular viewpoint in a hypergame. It means that if an agent (she) thinks another agent (he) is aware that an action is available to him, then she never excludes the action from his action set in her own subjective game.


## 4. Equivalence of Subjective Rationalizability and Rationalizability under Inside Common Knowledge

The concept of subjective rationalizability is apparently impractical because calculation of a subjectively rationalizable action requires us to identify a best response hierarchy, which consists of infinite elements. In this section, we prove that, under a condition called inside common knowledge, a subjectively rationalizable action can be replaced by a rationalizable action.In a normal form game, a rationalizable action is defined as such an action that survives iterative elimination of actions that cannot be a best response to any combinations of the others’ actions [10].Definition 5 (rationalizability).
LetG
=
(
I
,
A
,
u
) be a normal form game. a
i
*
∈
A
i is calledrationalizable for agent i if and only if a
i
*
∈
⋂
t
=
1
∞
‍
H
i
(
t
), where j
∀
∈
I, H
j
(
t
)
=
{
a
j
′
∈
A
j
∣
a
∃
-
j
∈
×
k
∈
I
∖
{
j
}
H
k
(
t
-
1
), a
∀
j
∈
A
j, u
j
(
a
j
′
,
a
-
j
)
≥
u
j
(
a
j
,
a
-
j
)
} with t
=
1,2
,
…, and H
j
(
0
)
=
A
j. Let us denote the set of rationalizable actions of agent i in G by R
i
(
G
).Then we introduce the concept of inside common knowledge (ICK) of viewpoints. In a hypergame, a viewpointσ is said to have ICK when every viewpoint lower than σ has the same subjective game as that of σ [6] (Inohara’s [6] original definition of the concept of inside common knowledge refers not to subjective games but to each agent’s choice of action, which he calls her final strategy; both definitions are the same in that the concept deals with an agent’s subjective belief of common knowledge of something. This kind of subjective common knowledge about the game structure is also discussed in [11]).Definition 6 (inside common knowledge).
LetH
=
(
I
,
(
G
σ
)
σ
∈
Σ
) be a hypergame. σ
∈
Σ is said to haveinside common knowledge if and only if τ
∀
∈
Σ
σ, G
τ
=
G
σ.ICK can be regarded as common knowledge perceived subjectively. For example, viewpointj
i’s having ICK means that agent i thinks agent j considers the game is common knowledge among the agents. Since it is quite unlikely that, in reality, people consider an enormous number of different games in an infinite hierarchy of perception, it would be natural to assume ICK at some particular level in the hierarchy.The next lemma assures that, under a viewpoint’s ICK, a subjectively rationalizable action of the viewpoint coincides with a rationalizable action of the lowest agent of the viewpoint in its subjective game.Lemma 7.
In a hypergameH
=
(
I
,
(
G
σ
)
σ
∈
Σ
), suppose σ
∈
Σ has ICK. Then, a
σ
*
∈
A
σ
1
σ is subjectively rationalizable for viewpoint σ if and only if a
σ
*
∈
R
σ
1
(
G
σ
).Proof.
LetH
=
(
I
,
(
G
σ
)
σ
∈
Σ
) be a hypergame and suppose σ
∈
Σ has ICK.
Proof ofif part: suppose a
σ
*
∈
A
σ
1
σ is rationalizable in G
σ, that is, by definition, a
σ
*
∈
⋂
t
=
1
∞
‍
H
σ
1
(
t
), where i
∀
∈
I
σ,  H
i
(
t
)
=
{
a
i
′
∈
A
i
σ
∣
a
∃
-
i
∈
×
j
∈
I
σ
∖
{
i
}
H
j
(
t
-
1
)
,
a
∀
i
∈
A
i
σ,  u
i
σ
(
a
i
′
,
a
-
i
)
≥
u
i
σ
(
a
i
,
a
-
i
)
} with t
=
1,2
,
…, and H
i
(
0
)
=
A
i
σ.
Forτ
∈
Σ
σ and i
∈
I
τ
∖
{
τ
1
}, let S
i
τ
=
{
a
i
∈
A
i
τ
∣
(
a
τ
1
′
,
a
-
τ
1
,
i
)
∃
∈
S
τ
×
(
×
j
∈
I
τ
∖
{
τ
1
,
i
}
A
j
τ
), a
∀
τ
1
∈
A
τ
1
τ, u
τ
1
τ
(
a
τ
1
′
,
a
i
,
a
-
τ
1
,
i
)
≥
u
τ
1
τ
(
a
τ
1
,
a
i
,
a
-
τ
1
,
i
)
} with S
σ
=
{
a
σ
*
}. S
i
τ is interpreted as the set of agent i’s actions that can constitute action profile of all the agents except for τ
1 to which some action of τ
1 in S
τ is a best response in G
τ. Due to σ’s ICK, for any τ
∈
Σ
σ and i
∈
I
τ
∖
{
τ
1
}, S
i
τ
=
{
a
i
∈
A
i
σ
∣
(
a
τ
1
′
,
a
-
τ
1
,
i
)
∃
∈
S
τ
×
(
×
j
∈
I
σ
∖
{
τ
1
,
i
}
A
j
σ
), a
∀
τ
1
∈
A
τ
1
σ
,
u
τ
1
σ
(
a
τ
1
′
,
a
i
,
a
-
τ
1
,
i
)
≥
u
τ
1
σ
(
a
τ
1
,
a
i
,
a
-
τ
1
,
i
)
}.
SupposeS
i
τ
=
ϕ for some τ
∈
Σ
σ and i
∈
I
τ
∖
{
τ
1
}. This means that any actions of τ
1 in S
τ cannot be a best response to any action profiles of the others in G
σ; that is, H
τ
1
(
1
)
∩
S
τ
=
ϕ. If τ
=
σ, then H
σ
1
(
1
)
∩
S
σ
=
ϕ
⇒
a
σ
*
∉
H
σ
1
(
1
)
⇒
a
σ
*
∉
R
σ
1
(
G
σ
). If τ
=
i
1
⋯
i
n
σ with n
≥
1, then H
i
1
(
1
)
∩
S
i
1
⋯
i
n
σ
=
ϕ
⇒
H
i
2
(
2
)
∩
S
i
2
⋯
i
n
σ
=
ϕ
⇒
⋯
⇒
H
i
n
(
n
)
∩
S
i
n
σ
=
ϕ
⇒
H
σ
1
(
1
)
∩
S
σ
=
ϕ
⇒
a
σ
*
∉
R
σ
1
(
G
σ
). Thus, in any case, a
σ
*
∉
R
σ
1
(
G
σ
), but this contradicts a
σ
*
∈
R
σ
1
(
G
σ
). Hence we have S
i
τ
≠
ϕ for any τ
∈
Σ
σ and i
∈
I
τ
∖
{
τ
1
}.
Therefore, there exists(
a
τ
)
τ
∈
Σ
σ such that a
τ
∈
S
τ for all τ
∈
Σ
σ. Then, in (
a
τ
)
τ
∈
Σ
σ, τ
∀
∈
Σ
σ, a
¯
∀
τ
∈
A
τ
1
τ,   and u
τ
1
τ
(
a
τ
,
a
-
τ
)
≥
u
τ
1
τ
(
a
¯
τ
,
a
-
τ
), where a
-
τ
=
(
a
i
τ
)
i
∈
I
τ
∖
{
τ
1
}. That is, this (
a
τ
)
τ
∈
Σ
σ is a best response hierarchy of Σ
σ. Since a
σ
=
a
σ
*, a
σ
* is subjectively rationalizable.
Proof ofonly if part: suppose a
σ
*
∈
A
σ
1
σ is a subjectively rationalizable action of viewpoint σ; that is, by definition, there exists a best response hierarchy of σ. Due to σ’s ICK, this implies that there exists (
a
τ
*
)
τ
∈
Σ
σ such that a
τ
*
∈
A
τ
1
σ for all τ
∈
Σ
σ which satisfies τ
∀
∈
Σ
σ, a
∀
τ
∈
A
τ
1
σ, and u
τ
1
σ
(
a
τ
*
,
a
-
τ
*
)
≥
u
τ
1
σ
(
a
τ
,
a
-
τ
*
), where a
-
τ
*
=
(
a
i
τ
*
)
i
∈
I
σ
∖
{
τ
1
}.
We defineH
i
(
t
) for any i
∈
I
σ with t
=
1,2
,
… in the same way as shown in the proof of if part above. Let us prove a
σ
*
∈
H
σ
1
(
n
) with some integer n
≥
1. For any i
1
⋯
i
n
σ
∈
Σ
σ, a
i
1
⋯
i
n
σ
*
∈
H
i
1
(
0
) because H
i
1
(
0
)
=
A
i
1
σ. Then, i
∀
2
⋯
i
n
σ
∈
Σ
σ, a
i
2
⋯
i
n
σ
*
∈
H
i
2
(
1
)
⇒
i
∀
3
⋯
i
n
σ
∈
Σ
σ, a
i
3
⋯
i
n
σ
*
∈
H
i
3
(
2
)
⇒
⋯
⇒
i
∀
n
σ
∈
Σ
σ, and a
i
n
σ
*
∈
H
i
n
(
n
-
1
)
⇒
a
σ
*
∈
H
σ
1
(
n
).
Since this holds for any integern
≥
1, a
σ
*
∈
H
σ
1
(
t
) for any integer t
≥
1; thus we have a
σ
*
∈
⋂
t
=
1
∞
‍
H
σ
1
(
t
). Hence a
σ
*
∈
R
σ
1
(
G
σ
).Then the next proposition states the following things. Suppose there exists a best response hierarchy of viewpointσ. If some viewpoint τ which is lower than σ or σ itself has ICK, then, in the hierarchy, the actions for all the viewpoints lower than τ (including τ itself) can be replaced by a rationalizable action of the lowest agent of τ in τ’s subjective game, when calculating subjectively rationalizable actions. That is, the definition of subjective rationalizability can also be described as follows under the condition of ICK.Proposition 8.
Letσ
∈
Σ in H
=
(
I
,
(
G
σ
)
σ
∈
Σ
) and suppose υ
∈
Σ
σ has ICK. a
σ
*
∈
A
σ
1
σ is subjectively rationalizable for viewpoint σ if and only if there exists (
(
a
τ
*
)
τ
∈
Σ
σ
∖
Σ
υ
,
a
υ
*
) such that a
τ
*
∈
A
τ
1
τ for all τ
∈
Σ
σ
∖
Σ
υ and a
υ
*
∈
A
υ
1
υ which satisfies the following:(i)
∀
τ
∈
Σ
σ
∖
Σ
υ, a
∀
τ
∈
A
τ
1
τ, and u
τ
1
τ
(
a
τ
*
,
a
-
τ
*
)
≥
u
τ
1
τ
(
a
τ
,
a
-
τ
*
), where a
-
τ
*
=
(
a
i
τ
*
)
i
∈
I
τ
∖
{
τ
1
};
(ii)
a
υ
*
∈
R
υ
1
(
G
υ
).Proof.
LetH
=
(
I
,
(
G
σ
)
σ
∈
Σ
) be a hypergame and σ
∈
Σ. Suppose υ
∈
Σ
σ has ICK.
Proof ofif part: suppose there exists (
(
a
τ
*
)
τ
∈
Σ
σ
∖
Σ
υ
,
a
υ
*
) such that a
τ
*
∈
A
τ
1
τ for all τ
∈
Σ
σ
∖
Σ
υ and a
υ
*
∈
A
υ
1
υ which satisfies both of the two conditions described in Proposition 8. Then, due to Lemma 7, a
υ is υ’s subjectively rationalizable action in G
υ; that is, there exists (
a
ω
*
)
ω
∈
Σ
υ such that a
ω
*
∈
A
ω
1
ω for all ω
∈
Σ
υ, and ω
∀
∈
Σ
υ, a
∀
ω
∈
A
ω
1
ω, and u
ω
1
ω
(
a
ω
*
,
a
-
ω
*
)
≥
u
ω
1
ω
(
a
ω
,
a
-
ω
*
), where a
-
ω
*
=
(
a
i
ω
*
)
i
∈
I
ω
∖
{
ω
1
}. Therefore (
(
a
τ
*
)
τ
∈
Σ
σ
∖
Σ
υ
,
(
a
ω
*
)
ω
∈
Σ
υ
) is a best response hierarchy of σ, and hence a
σ
* in (
(
a
τ
*
)
τ
∈
Σ
σ
∖
Σ
υ
,
a
υ
*
) is σ’s subjectively rationalizable action.
Proof ofonly if part: suppose a
σ
*
∈
A
σ
1
σ is σ’s subjectively rationalizable action, and let (
a
τ
*
)
τ
∈
Σ
σ be a best response hierarchy of σ. Then, for υ
∈
Σ
σ, (
a
ω
*
)
ω
∈
Σ
υ in it is a best response hierarchy of viewpoint υ; thus a
υ
* is υ’s subjectively rationalizable action. Since υ has ICK, a
υ
*
∈
R
υ
1
(
G
υ
) due to Lemma 7. Hence (
(
a
τ
*
)
τ
∈
Σ
σ
∖
Σ
υ
,
a
υ
*
) satisfies both of the two conditions in Proposition 8.When we want to know viewpointσ’s subjectively rationalizable action, instead of identifying a best response hierarchy with infinite elements as described in Definition 3, we just need to have rationalizable actions in subjective games of viewpoints having ICK and identify a “reduced” best response hierarchy based on them as described in the proposition.To see an example, reconsider the example of Figure1. Suppose now all the viewpoints one-step lower than viewpoint i, namely, viewpoint 1
i
,
.
.
.
,
m
i, have ICK; that is, agent i considers every other agent thinks the game is common knowledge though each agent may perceive different games (Figure 2). Then Proposition 8 implies that if a
1
i
* is agent 1’s rationalizable action in viewpoint 1
i’s subjective game,..., and a
m
i
* is agent m’s rationalizable action in viewpoint m
i’s subjective game, then agent i’s best response in viewpoint i’s subjective game to (
a
1
i
*
,
…
,
a
m
i
*
), that is, a
i
*, is a subjectively rationalizable action for agent i. In this way, we can calculate an agent’s subjectively rationalizable action much more simply by applying the proposition.Figure 2
Subjective rationalizability under ICK.


## 5. Example and Discussions

We show an example of the concepts and findings presented so far. In particular, our focus is to illustrate how subjective rationalizability can give us new insights compared to existing solution concepts, as well as how the results obtained in the previous section can be applied when analyzing a hypergame.Let us consider a two-agent hypergame withI
=
{
i
,
j
}. i’s view is given as viewpoint i’s subjective game, G
i, as shown in Table 1. i’s decision depends on i’s expectation about j’s choice, which depends on i’s view about how j perceives the game. Suppose that i thinks j thinks the game they play is not Table 1 but Table 2, which is viewpoint j
i’s subjective game, G
j
i. It is slightly different with G
i in terms of i’s utility. This means that i thinks j misperceives i’s utility function. Furthermore, we assume that i thinks j thinks the game G
j
i is common knowledge, namely, viewpoint j
i’s ICK. This means, while i
j
i, j
i
j
i, …
∈
Σ
j
i, G
i
j
i, G
j
i
j
i, … are the same as G
j
i.Table 1
Viewpointi’s subjective game.
i
∖
j
x
y
z
a
2
,
2
2
,
3
0
,
0
b
3
,
3
3
,
2
0
,
0
c
0
,
0
0
,
0
1
,
1Table 2
Viewpointj
i’s subjective game.
i
∖
j
x
y
z
a
3
,
2
2
,
3
0
,
0
b
2
,
3
3
,
2
0
,
0
c
0
,
0
0
,
0
1
,
1If, following the conventional way of analysis, we regard the situation as a two-level hypergame and apply Nash-type solution concept, the analysis would go as follows:G
j
i has the unique Nash equilibrium, (
c
,
z
). Then, expecting j to choose z, i takes the best response to it in G
i, namely, c.InG
j
i, however, j’s other actions, x and y, appear rather attractive for j. Indeed not only z but also these two actions are rationalizable for j. Due to Lemma 7, given that viewpoint j
i has ICK, all of these three actions are subjectively rationalizable for viewpoint j
i. Then, Proposition 8 implies that i’s action that can be a best response to any of these actions in G
i is subjectively rationalizable for viewpoint i, namely b and c. Therefore, if i makes decision according to the idea of subjective rationalizability, i may choose not only c but also b.Hence, in general, the prediction power of subjective rationalizability is weaker than conventional solution concepts. This is the case with rationalizability whose prediction power is weaker than Nash equilibrium. Rather, it often tells us nothing about prediction of a game because any actions can be rationalizable in some games, for example, battle of sexes and chicken games. Rationalizability, however, is insightful in that it provides the precise implication of common knowledge of the game structure as well as rationality of agents. Likewise, we characterize subjective rationalizability as such a tool that tells us the precise implication of a given hypergame structure. We also note that we would obtain the same result if we regard the situation above as a two-level hypergame and simply apply not Nash equilibrium but rationalizability; however our findings ensure that the agent’s choice predicted by subjective rationalizability is theoretically consistent with this idea.Possible outcomes of a hypergame are given as any combinations of each agent’s subjectively rationalizable action. Therefore, in a realized outcome, an agent may notice her choice is actually not rationalizable; that is, it may not be a best response to the opponent’s choice. For example, in the case above, suppose agentj actually perceives the game shown in Table 3 and G
j: j is unaware of i’s action c as well as j’s own action z. If viewpoint j has ICK, since y is the only rationalizable action in G
j, it is the only subjectively rationalizable action for agent j. Among viewpoint i’s two subjectively rationalizable actions, b is a best response to y, but c is not. Hence it is called “subjectively” rationalizable.Table 3
Viewpointj’s subjective game.
i
∖
j
x
y
a
3
,
2
2
,
3
b
2
,
2
3
,
3


## 6. Conclusion

The contribution of the present study is mainly twofold. First, we have proposed a new solution concept in hypergames called subjective rationalizability. It is based on an idea that every agent takes a best response to expected choices of the others, every agent thinks every agent takes a best response to expected choices of the others, and so on. It is characterized as such a tool that provides the precise implication of a given hypergame structure. Second, we have proved the equivalence of subjective rationalizability and the standard notion of rationalizability under ICK. The result is useful to avoid the problem that it is practically impossible to calculate subjectively rationalizable actions in the way described by the original definition and thus makes the concept applicable to hypergame analysis.Hypergame analysis has been applied to conflict analysis traditionally [2, 12, 13] and recently to a wider range of areas such as information security [14], service science [15] and systems thinking [16]. As far as the author knows, all of them apply solution concepts based on the conventional ideas mentioned in the introduction. Subjective rationalizability provides new insights that are theoretically consistent with the idea of rationalizability in game theory; thus it can contribute to improving analytical power of hypergames and making the analyses more convincing.Subjective rationalizability is a solution concept for one-shot hypergames. Therefore, if an analyzer’s interest is in a situation in which a hypergame is played multiple times and agents may update their views in the course of decisions, we need an additional framework to deal with it. For example, in the example shown in Section5, if agent i takes a subjectively rationalizable action, c, then the other agent j first notices such an action is available to i; thus j would revise the subjective view before playing the next period game so as to include it in i’s action set. Such a learning process of an agent in repetitive hypergames has been studied only in a few references [17, 18]. We consider the notion of subjective rationalizability can be one plausible candidate for a solution concept of each period game in such a repetitive hypergame situation.



---

*Source: 263615-2014-07-10.xml*