• Aucun résultat trouvé

Understanding reasoning using utility proportional beliefs

N/A
N/A
Protected

Academic year: 2022

Partager "Understanding reasoning using utility proportional beliefs"

Copied!
5
0
0

Texte intégral

(1)

Understanding Reasoning Using Utility Proportional Beliefs

Christian Nauerz EpiCenter, Maastricht University c.nauerz@maastrichtuniversity.nl

Abstract. Traditionally very little attention has been paid to the reasoning pro- cess that underlies a game theoretic solution concept. When modeling bounded rationality in one-shot games, however, the reasoning process can be a great source of insight. The reasoning process itself can provide testable assertions, which pro- vide more insight than the fit to experimental data. Based on Bach and Perea’s [1]

concept of utility proportional beliefs, we analyze the players’ reasoning process and find three testable implications: (1) players form an initial belief that is the basis for further reasoning; (2) players reason by alternatingly considering their own and their opponent’s incentives; (3) players perform only several rounds of deliberate reasoning.

Keywords: Epistemic game theory, interactive epistemology, solution concepts, bounded rationality, utility proportional beliefs, reasoning.

1 Introduction

Most of the ongoing research in game theory focuses on the prediction of players’ choices.

In this paper, we want to take another perspective and look at the players’ reasoning pro- cess rather than their decisions. This perspective can be especially helpful to understand experimental data from one-shot games without opportunities for learning or coordinat- ing. Existing bounded rationality concepts (e.g. Quantal Response Equilibrium (QRE) [5] or Cognitive Hierarchy Models (CHM) [3]) focus mainly on the prediction of empirical frequencies rather than accurately mimicking players’ reasoning process. Therefore, these concepts do not provide a clear rationale for players selecting certain choices. The under- lying idea of a concept might give a hint but no a clear insight. Most often, these models are evaluated by comparing their fit to the data. This method, however, tells us little about the validity of certain features of the models. A deeper insight into the reasoning process could help to better understand a concept’s characteristics and therefore which features work well and which do not. Therefore, a concept that makes clear assertions about the reasoning process can be tested much more rigorously. In fact, a good concept should present clear assertions about the reasoning process that can be tested individually and in their interaction with each other. In this paper, we discuss a solution concept that is based on a general idea and provides detailed assertions about the reasoning process that can be tested individually.

2 Utility Proportional Beliefs

Bach and Perea [1], henceforth BP, suggest a concept for bounded rationality that builds up on a simple idea: the differences in probabilities a player assigns to his opponent’s

(2)

choices should be equal to the differences in the opponent’s utilities for these choices. BP, formalize the solution concept using the type-based approach to epistemic game theory.

Here we will only introduce the main definition and focus on the two player case. For a more formal treatment consult BP. However, before stating the definition of utility proportional beliefs we need to introduce some further notation.

By I ={1,2} we denote the set of players, byCj we denote player j’s finite choice set, byTj we denote playerj’s set of types, and byUi :Ci⇥Cj !Rwe denote player i’s utility function. The best and the worst possible utilities of player j are denoted as

¯

uj := maxc2Cuj(c) and uj := minc2Cuj(c). (bi(ti))(cj|tj) gives the probability that player i’s type ti assigns toj’s choice cj given that j is of type tj, where ti 2 Ti and tj 2Tj.

Definition 1. Leti, j2Ibe the two players, and j 2Rsuch that j 0. A typeti2Ti

of player iexpresses j-utility-proportional-beliefs, if (bi(ti))(cj|tj) (bi(ti))(c0j|tj) = j

¯

uj uj(uj(cj, tj) uj(c0j, tj)) (2.1) for alltj2Tj(ti), for allcj,c0j 2Cj.

The definition directly corresponds to the idea of utility proportional beliefs: the difference in probabilities playeriassigns to the opponents’ choices is equal to the difference of the utilities times the proportionality factor j/(¯uj uj). BP give an intuitive interpretation of j as measure of the sensitivity of a player’s beliefs to differences in the opponents utilities. Note that there exists an upper bound for the j called maxj . It is the maximum value of j for which equation (2.1) yields well-defined probability measures. The lower limit of j is0.

The concept of common belief in -utility-proportional-beliefsrequires that both play- ers entertain utility proportional beliefs, that both players believe their opponent holds utility proportional beliefs, that both players believe their opponents believe that their opponents do so, and so on. BP introduce an algorithm to find exactly those beliefs that are possible under common belief in -utility-proportional-beliefs. The algorithm itera- tively deletes beliefs so that only the beliefs, which are possible under common belief in

-utility-proportional-beliefs, survive.

BP show in their Theorem 2 that beliefs are unique in the two player case. By using their Lemma 4 we find an explicit expression for the unique beliefs under common belief in -utility-proportional-beliefs instead of using their algorithm. This expression reveals clues about the reasoning process players might go through to obtain utility proportional beliefs.

3 Reasoning Process

To introduce the formula for the player’s beliefs some more notation needs to be fixed. We denote the number of choices of playeribyn=|Ci|and the number of choices for player j bym=|Cj|. Moreover, letN ={1, ..., n}andM ={1, ..., m}. Then⇥1vectorin with in = (n1, ...,1n). LetCi={c1i, . . . , cni}andCj={c1j, . . . , cmj }so that we can denote player i’sn⇥m utility matrix by

Uinorm= 1 ui ui

2 64

Ui(c1i, c1j)· · · Ui(c1i, cmj )

... ...

Ui(cni, c1j)· · ·Ui(cni, cmj ) 3 75.

Them⇥mmatrixZmhas mm1 on the diagonal and m1 offthe diagonal. Intuitively, the centering matrix subtracts the mean from the columns of a matrix when left multiplied.

(3)

We define the matrixGj:= jZmUjnormsince it will be useful to develop a more intuitive understanding. By left-multiplying the normalized utility matrixUjnormwith the centering matrixZm, one obtains a matrix where for every element the average of its column has been subtracted. Note that the rows ofUjnorm correspond toi’s choices and the columns to j’s choices. The same holds for the matrix ZmUjnorm, only that now each element represents the relative goodness of a choice given an opponent’s choice. Therefore, the matrixGj gives the goodness of a choice given a belief about the opponent’s choice, scaled by the sensitivity to the opponents differences in utility j.

Now we can state the formula fori’s beliefs aboutj’s choices under common belief in -utility-proportional-beliefs:

i = X1 k=0

(GjGi)k(im+Gjin) (3.1)

= (im+Gjin) +GjGi(im+Gjin) +GjGi[GjGi(im+Gjin)] +· · · ,

where iis am⇥1vector with the probabilities that playeriassigns to playerj’s choices.

We see that the expression(im+Gjin)is repeated several times. In the second term, this expression is then adjusted by left multiplying the matricesGjGi. In the third term the second term is adjusted by left multiplying GjGi, and so on. Therefore, we call (im+Gjin)the initial belief, iinitial. It shows how playeri constructs her beliefs about player j without taking into account that player j reasons about her. Playeri starts off by assigning equal probability to her opponent’s choice combinations. Then she adjusts her belief by adding the termGjin, which represents the goodness ofj’s choices whenj assigns equal probability to all ofi’s choices.

To emphasize the reasoning process, we define ikas the belief that playeriholds after thekth reasoning step,

0

i := iinitial

k

i := iinitial+GjGi( ik 1), such thatlimk!1 k

i = iholds. To obtain a more intuitive understanding we rewrite ik

as follows

k

i =im+Gj(in+Gi( ik 1)).

We see that first player i takes j’s perspective, which is reflected in the expression in+Gi( ik 1). Here playerj forms a belief about player i given i’s belief aboutj from the previous reasoning step. First j assigns equal probability to all of i’s choices. Then she corrects these beliefs by the goodness ofi’s choices giveni’s belief about j from the previous reasoning step. The result is a new belief ofj about i. Then player i takes her own perspective and assigns equal probability to all ofj’s choices. These probabilities are then again corrected by the goodness ofj’s choices given the new belief ofj abouti.The process then continues in the same fashion for the subsequent reasoning steps.

It is also important to note that later reasoning steps will be less important for the final belief than earlier ones. Define i =↵i max with ↵i 2 [0,1) and note that Gj =

i max

i ZmUjnorm, so that (3.1) can be written as

i= X1 k=0

(↵ij max

i max

j ZmUjnormZnUinorm)k initiali . Since↵i,↵j 2[0,1), later terms inP1

k=0(↵ij max

i max

j ZmUjZnUi)kwill be smaller than earlier ones and therefore less important for the final belief i. This has also an important

(4)

implication for the meaning of the proportionality factor i: the lower the value of ithe fewer steps of reasoning a player will undergo to approximate the final belief within a reasonable bound. The same holds true for her opponent’s proportionality factor.

4 Connections to Psychology

These features correspond closely to findings in the psychology literature. In his book

“Thinking, Fast and Slow” Kahneman [4] advocates the idea of reasoning in two distinct ways. He calls the two modes of thinking System 1 and System 2, according to Stanovich [6]. Note that the word system should not indicate an actual system but only serves as label for different modes of thinking. System 1 is an automatic and mostly unconscious way of thinking that demands little computational capacity. System 2 describes the idea of deliberate reasoning. It comes into play when controlled analytical thinking is needed.

Table 1 summarizes the properties of the two systems according to [6].

System 1 System 2

associative rule-based

holistic analytic

relatively undemanding of cognitive

capacity demanding of cognitive capacity

relatively fast relatively slow

acquisition by biology, exposure, and

personal experience acquisition by cultural and formal tuition

Table 1.Properties of System 1 & 2

The concept of System 1 describes the unconscious first reaction to a situation, which happens almost immediately and without demanding a lot of cognitive resources. More- over, Kahneman [4] argues that the beliefs formed by System 1 are the basis for conscious reasoning within System 2. This is consistent with our findings since the initial belief does not take into account any strategic interaction. This belief can be seen as an au- tomatic initial reaction to the game. The deliberate reasoning process described above can be imagined as being executed by System 2 using the findings of System 1, or in this case the initial belief. Taking another player’s perspective takes deliberate reasoning and can hardly be done automatically. Finally, we showed that the final belief can be approximated with finitely many steps of reasoning. This feature is closely related to the problem of limited working memory. Baddeley [2] defines working memory as "... [A] brain system that provides temporary storage and manipulation of the information necessary for such complex cognitive tasks as language comprehension, learning, and reasoning."

Since working memory is critical for reasoning, however bounded, human beings can only perform a limited number of reasoning without the support of tools. Therefore, a model resembling human reasoning should not predict an infinite amount of reasoning steps.

References

1. Bach, C.W., Perea, A.: Utility proportional beliefs. International Journal of Game Theory pp.

1–22 (2014)

(5)

2. Baddeley, A.: Working memory. Science 255(5044), 556–559 (1992)

3. Camerer, C.F., Ho, T.H., Chong, J.K.: A cognitive hierarchy model of games. The Quarterly Journal of Economics 119(3), 861–898 (2004)

4. Kahneman, D.: Thinking, fast and slow. Macmillan (2011)

5. McKelvey, R.D., Palfrey, T.R.: Quantal response equilibria for normal form games. Games and economic behavior 10(1), 6–38 (1995)

6. Stanovich, K.E., West, R.F., et al.: Individual differences in reasoning: Implications for the rationality debate? Behavioral and brain sciences 23(5), 645–665 (2000)

Références

Documents relatifs

As the channel conditions experienced by vehicular users in cellular networks vary as they move, we investigate to which extent the quality of channel allocation could be improved

In [1], the authors use a different kind of proportional fair objective function to ours, and they use future information by looking at channel state of users in a few

If the belief function reference lotteries we use are Bayesian belief functions, then our representation theorem coincides with Jaffray’s repre- sentation theorem for his linear

In this article, we address this problem in the context of the theory of belief functions, also known as Dempster–Shafer theory [5], [2] by proposing three schemes for

This new modeling approach paved the way for the more general model in [CS06] (with time varying and random proportional transaction costs), which in turn provided the necessary

These operators can be seen as a direct extension of the classical qualitative operators (q-operators) proposed recently in the Dezert-Smarandache Theory of plausible and

In this section we investigate the utility of the proposed neighbourhood singleton-style con- sistency algorithms, as well as the discussed state-of-the-art local consistency

About their activity on the computer we observed that the presence of the e-exercises resource changes the didactical contract, and leads students to develop different