A risk-averse price-setting firm which knows the quantity demanded at the status quo price but has imperfect information otherwise may choose not to change it although an otherwise identical risk-neutral firm would do so, provided the variance of the firm's subjective probability distribution over quantities demanded as a function of price displays a kink at the status quo. This is equivalent t...

For many long-lived mammalian species, extended maternal investment has a profound effect on offspring integration in complex social environments. One component of this investment may be aiding young in aggressive interactions, which can set the stage for offspring social position later in life. Here we examined maternal effects on dyadic aggressive interactions between immature (<12 years) chi...

Within a contest there is some probability Mi(t) that contestant i will be the winner, given information available at time t, and Mi(t) must be a martingale in t. Assume continuous paths, to capture the idea that relevant information is acquired slowly. Provided each contestant’s initial winning probability is at most b, one can easily calculate, without needing further model specification, the...

We construct a non-locality game that can be won with certainty by a quantum strategy using logn shared EPR-pairs, while any classical strategy has winning probability at most 1 2 +O (

Higher powers of the Odd Cycle Game has been the focus of recent investigations [3,4]. In [4] it was shown that if we repeat the game d times in parallel, the winning probability is upper bounded by 1 −Ω( √

We provide a revealed preference characterization of expected utility maximization in binary lotteries with prize-probability trade-offs. start by characterizing optimizing behavior when the empirical analyst exactly knows function or probability winning. Next, we consider situation both and unknown. In this case has content imposing mild shape restriction that at least one these functions is l...

In this thesis, we answer several questions about the behaviour of prover-verifier interactions under parallel repetition when quantum information is allowed, and the verifier acts independently in them. We first consider the case in which a value is associated with each of the possible outcomes of an interaction. We prove that it is not possible for the prover to improve on the optimum average...

a r t i c l e i n f o a b s t r a c t We investigate the extent to which it is possible to compute the probability of a particular candidate winning an election, given imperfect information about the preferences of the electorate. We assume that for each voter, we have a probability distribution over a set of preference orderings. Thus, for each voter, we have a number of possible preference or...