4 Preferences over a Set of Generalized Lotteries

Given a finite set of generalized lotteries, that is random quantities equipped with a belief function, and a partial preference rela- tion on them, a necessary and sufficient

This paper is organized as follows. First of all we shall revisit the original version of Next-Closure, together with the basic definitions. Then we present our generalized

The first theorem in [1] states that, if the Markov chain is strongly lumpable, then the eigenvalues of the probability transition matrix P b of agg(α, A, P ) (a partition P is

We then present Theorem 2.5, generalizing Theorem 2.2, which gives existence and uniqueness of a classical solution u of (1.4) under one of the boundary conditions (BC1), (BC2),

— To a locally compact group G with a left invariant Haar measure ds, there correspond three von Neumann algebras on the Hilbert space L^(G) of all square integrable functions on G

[4] The cardinality of the labeling set of an element (vertex or edge) of a graph G is called the set-indexing number of that element..

Jang SCHILTZ (University of Luxembourg) A generalized finite mixture model July 28, 2015 9 / 23.. An

In this section, we will give some properties of these Green functions that we will need later. The proof of the following lemma is based on elementary potential theory on the