6,323 research outputs found
Every hierarchy of beliefs is a type
When modeling game situations of incomplete information one usually considers
the players' hierarchies of beliefs, a source of all sorts of complications.
Hars\'anyi (1967-68)'s idea henceforth referred to as the "Hars\'anyi 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.Comment: 19 page
Generalized Descents and Normality
We use Janson's dependency criterion to prove that the distribution of
-descents of permutations of length converge to a normal distribution as
goes to infinity. We show that this remains true even if is allowed to
grow with , up to a certain degree.Comment: 7 page
Lower Bounds for RAMs and Quantifier Elimination
We are considering RAMs , with wordlength , whose arithmetic
instructions are the arithmetic operations multiplication and addition modulo
, the unary function , the binary
functions (with ), ,
, and the boolean vector operations defined on
sequences of length . It also has the other RAM instructions. The size
of the memory is restricted only by the address space, that is, it is
words. The RAMs has a finite instruction set, each instruction is encoded by a
fixed natural number independently of . Therefore a program can run on
each machine , if is sufficiently large. We show that there
exists an and a program , such that it satisfies the following
two conditions.
(i) For all sufficiently large , if running on gets an
input consisting of two words and , then, in constant time, it gives a
output .
(ii) Suppose that is a program such that for each sufficiently large
, if , running on , gets a word of length as an
input, then it decides whether there exists a word of length such that
. Then, for infinitely many positive integers , there exists a
word of length , such that the running time of on at
input is at least
- …