We consider the optimization problem of a decision maker facing a sequence of coin tosses with an initially unknown probability Θ for heads. Before each toss she bets on either heads or tails and she wins one euro if she guesses correctly, otherwise she loses one euro. We investigate the effect...

We consider the optimization problem of a decision maker facing a sequence of coin tosses with an initially unknown probability Θ for heads. Before each toss she bets on either heads or tails and she wins one euro if she guesses correctly, otherwise she loses one euro. We investigate the effect...

In this paper, we consider different issues related to Archimedean copulæ and positive dependence. In the first part, we characterize Archimedean copulæ that possess positive dependence properties such as multivariate total positivity of order 2 (MTP2) and conditionally increasingness in...

In this paper we solve two open problems posed by Joe (1997) concerning the supermodular order. First we give an example which shows that the supermodular order is strictly stronger than the concordance order for dimension d=3. Second we show that the supermodular order fulfils all desirable...

We provide some counterexamples showing that some concepts of positive dependence are strictly stronger than others. In particular we will settle two questions posed by Pemantle (2000) and Pellerey (2002) concerning respectively association versus weak association, weak association versus...

In the first part of the paper we consider positive dependence properties of Archimedean copulae. Especially we characterize the Archimedean copulae that are multivariate totally positive of order 2 (MTP2) and conditionally increasing in sequence. In the second part we investigate conditions for...

We exhibit a general class of interactive decision situations in which all the agents benefit from more information. This class includes as a special case the classical comparison of statistical experiments a la Blackwell.

We consider a stronger version of the paradox of multiple elections and show that it is possible that not only the winning combination of propositions, but also all the combinations sufficiently close to it, receive zero votes.