اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEvery hierarchy of beliefs is a type
435
0
0.0
(
0
)
نشر من قبل
Mikl\\'os Pint\\'er
تاريخ النشر
2012
مجال البحث
الهندسة المعلوماتية
والبحث باللغة
English
تأليف
Miklos Pinter
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
When modeling game situations of incomplete information one usually considers the players hierarchies of beliefs, a source of all sorts of complications. Harsanyi (1967-68)s idea henceforth referred to as the Harsanyi program is that hierarchies of beliefs can be replaced by types. The types constitute the type space. In the purely measurable framework Heifetz and Samet (1998) formalize the concept of type spaces and prove the existence and the uniqueness of a universal type space. Meier (2001) shows that the purely measurable universal type space is complete, i.e., it is a consistent object. With the aim of adding the finishing touch to these results, we will prove in this paper that in the purely measurable framework every hierarchy of beliefs can be represented by a unique element of the complete universal type space.
قيم البحث
اقرأ أيضاً
This work explores a social learning problem with agents having nonidentical noise variances and mismatched beliefs. We consider an $N$-agent binary hypothesis test in which each agent sequentially makes a decision based not only on a private observa
tion, but also on preceding agents decisions. In addition, the agents have their own beliefs instead of the true prior, and have nonidentical noise variances in the private signal. We focus on the Bayes risk of the last agent, where preceding agents are selfish. We first derive the optimal decision rule by recursive belief update and conclude, counterintuitively, that beliefs deviating from the true prior could be optimal in this setting. The effect of nonidentical noise levels in the two-agent case is also considered and analytical properties of the optimal belief curves are given. Next, we consider a predecessor selection problem wherein the subsequent agent of a certain belief chooses a predecessor from a set of candidates with varying beliefs. We characterize the decision region for choosing such a predecessor and argue that a subsequent agent with beliefs varying from the true prior often ends up selecting a suboptimal predecessor, indicating the need for a social planner. Lastly, we discuss an augmented intelligence design problem that uses a model of human behavior from cumulative prospect theory and investigate its near-optimality and suboptimality.
We show that every knot can be realized as a billiard trajectory in a convex prism. This solves a conjecture of Jones and Przytycki.
For certain spectral parameters we find explicit eigenfunctions of transfer operators for Schottky surfaces. Comparing the dimension of the eigenspace for the spectral parameter zero with the multiplicity of topological zeros of the Selberg zeta func
tion, we deduce that zero is a resonance of every Schottky surface.
We answer the title question for sigma-unital C*-algebras. The answer is that the algebra must be the direct sum of a dual C*-algebra and a C*-algebra satisfying a certain local unitality condition. We also discuss similar problems in the context of
Hilbert C*-bimodules and imprimitivity bimodules and in the context of centralizers of Pedersens ideal.
Geographic routing is a routing paradigm, which uses geographic coordinates of network nodes to determine routes. Greedy routing, the simplest form of geographic routing forwards a packet to the closest neighbor towards the destination. A greedy embe
dding is a embedding of a graph on a geometric space such that greedy routing always guarantees delivery. A Schnyder drawing is a classical way to draw a planar graph. In this manuscript, we show that every Schnyder drawing is a greedy embedding, based on a generalized definition of greedy routing.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
