在博弈论中,贝叶斯博弈(英语:Bayesian game)所指的是:博弈参与者对于对手的收益函数,无法获得完全信息(complete information);因此贝叶斯博弈也被称为不完全信息博弈。因为使用了贝叶斯法则(Bayes’ rule)来进行概率分析,因此得名。
Bayesian Games
Determine, with justification, wether the following ideals are prime, maximal, both, or neither.
(a) ⟨x3−1⟩ in Q[x].
(b) ⟨x9+7⟩ in Q[x]
(c
A Bayesian game is a list (N,A,Θ,T,u,p)
- N : set of players
- A=(Ai)i∈N: set of action profiles
- Θ : set of payoff parameters
- Ti: set of types for player i;T=∏i∈NTi
- ui:Θ×A→R: payoff function of player i
pi(⋅∣ti)∈Δ(Θ×T−i): belief of type ti
Each player i knows his own type ti but does not necessarily know θ or other players’ types. .. belief pi(⋅∣ti)
The game has a common prior if there exists π∈Δ(Θ×T) such that
pi(⋅∣ti)=π(⋅∣ti),∀ti∈Ti,∀i∈N
Infinite Hierarchies of Beliefs
When a researcher models incomplete information, there is often no ex-ante stage or explicit information structure in which players observe signals and make inferences. At the modeling stage, each player i has an infinite hierarchy of beliefs
- a first-order belief τ1i∈Δ(Θ) about payoffs (and other aspects of the world)
- a second-order belief τ2i∈Δ(Θ×Δ(Θ)N∖i) about θ and other players’ first-order beliefs τ1−i
- a third-order belief τ3i about correlations in player i’s second-order uncertainty τ2i and other players’ second-order beliefs τ2−i…
Formal Definition
For simplicity, consider two players.
Suppose that Θ is a Polish (complete separable metric) space.
Player i has beliefs about θ, about other’s beliefs about θ,…
X0=Θ X1=X0×Δ(X0) ⋮ Xn=Xn−1×Δ(Xn−1) ⋮
τi=(τ1i,τ2i,…)∈∏∞n=0Δ(Xn): belief hierarchy of player i
Hi=∏∞n=0Δ(Xn): set of i ‘s hierarchies of beliefs
Every Xn is Polish. Endow Xn with the weak topology.
Interpretation of Type Space
Harsanyi’s (1967) parsimonious formalization of incomplete information through a type space (Θ,T,p) naturally generates an infinite hierarchy of beliefs for each ti∈Ti, which is consistent by construction:
first-order belief: h1i(⋅∣ti)=margΘp(⋅∣ti)=∑t−ip(θ,t−i∣ti)
second-order belief: h2i(θ,ˆh−i1∣ti)=∑t−i∣h1−i(⋅∣t−i)=ˆh−i1p(θ,t−i∣ti)…
A type ti∈Ti in a space (Θ,T,p) models a belief hierarchy (τ1i,τ2i,…) if hni(⋅∣ti)=τni for each n
Coherency
How expressive is Harsanyi’s language?
Is there (T,p) s.t. \left{h_{i}\left(\cdot \mid t_{i}\right) \mid t_{i} \in T_{i}\right}=H_{i} ?
Hierarchies should be coherent:
margXn−2τni=τn−1i
Different levels of beliefs should not contradict one another. H0i : set of i’s coherent hierarchies.
Proposition 1 (Brandenburger and Dekel 1993)
There exists a homeomorphism fi:H0i→Δ(Θ×H−i) s.t.
margXn−1fi(⋅∣τi)=τni,∀n≥1
Common Knowledge of Coherency
Is there (T,p) s.t. \left{h_{i}\left(\cdot \mid t_{i}\right) \mid t_{i} \in T_{i}\right}=H_{i}^{0} ?
We need to restrict attention to hierarchies of beliefs under which there is common knowledge of coherency:
\begin{aligned} \text { – } & H_{i}^{1}=\left{\tau_{i} \in H_{i}^{0} \mid f_{i}\left(H_{-i}^{0} \mid \tau_{i}\right)=1\right} \ & H_{i}^{2}=\left{\tau_{i} \in H_{i}^{1} \mid f_{i}\left(H_{-i}^{1} \mid \tau_{i}\right)=1\right} \ & \ldots \ \text { – } & H_{i}^{*}=\bigcap_{k \geq 0} H_{i}^{k} \end{aligned}
The Interim Game
For any Bayesian game B=(N,A,Θ,T,u,p), define the interim game IG(B)=(ˆN,ˆS,U)
ˆN=Ui∈NTi ˆSti=Ai ˆUti(ˆs)=Epi(⋅∣ti)[ui(θ,ˆs)]≡∑(θ,ti)pi(θ,t−i∣ti)ui(θ,ˆsti,ˆst−i),∀ti∈ˆN
where ˆs=(ˆsti)ti∈ˆN
Assume finite Θ×T to avoid measurability issues.
Th Ex Ante Game
For a Bayesian game B=(N,A,Θ,T,u,π) with a common prior π, the ex-ante game G(B)=(N,S,U) is given by
Si=ATii∋si:Ti→Ai Ui(s)=Eπ[ui(θ,s(t))]
Bayesian Nash Equilibrium
Strategies of player i in B are mappings si:Ti→Ai (measurable when Ti is uncountable).
Definition 1
In a Bayesian game B=(N,A,Θ,T,u,p), a strategy profile s:T→A is a Bayesian Nash equilibrium (BNE) if it corresponds to a Nash equilibrium of IG(B), i.e., for every i∈N,ti∈Ti
Epi(⋅∣ti)[ui(θ,si(ti),s−i(t−i))]≥Epi(⋅∣ti)[ui(θ,ai,s−i(t−i))],∀ai∈Ai
Interim rather than ex ante definition preferred since in models with a continuum of types the ex ante game has many spurious equilibria that differ on probability zero sets of types.
real analysis代写analysis 2, analysis 3请认准UprivateTA™. UprivateTA™为您的留学生涯保驾护航。