نتایج جستجو برای: probability of winning demanded

تعداد نتایج: 21171288  

2011
Daniel Villanueva Andrés Feijóo José Luis Pazos

In this paper a procedure is established for solving the Probabilistic Load Flow in an electrical power network, considering correlation between power generated by power plants, loads demanded on each bus and power injected by wind farms. The method proposed is based on the generation of correlated series of power values, which can be used in a MonteCarlo simulation, to obtain the probability d...

Journal: :Fluctuation and Noise Letters 2022

We investigate the possibility of implementing a sequence quantum walks whose probability distributions give an overall positive winning probability, while it is negative for single (Parrondo’s paradox). In particular, we have in mind experimental realization with Bose–Einstein condensate which walker’s space momentum space. Experimental problems precise implementation coin operations our discr...

Journal: :Oxford Bulletin of Economics and Statistics 2022

This article documents spillover effects using participation in an elite international football tournament as a laboratory. Using novel dataset from top 5 European leagues, we find that highly selective UEFA Champions League (UCL) generates large performance gains to participating teams their domestic leagues. More precisely, UCL improves goal difference (goals scored minus goals conceded) by a...

Journal: :Electronic Colloquium on Computational Complexity (ECCC) 2009
Massimo Lauria

We study the space required by Polynomial Calculus refutations of random k-CNFs. We are interested in how many monomials one needs to keep in memory to carry on a refutation. More precisely we show that for k ≥ 4 a refutation of a random k-CNF of ∆n clauses and n variables requires monomial space Ω(n∆− 1+ k−3− ) with high probability. For constant ∆ we prove that monomial space complexity is Θ(...

Journal: :Games and Economic Behavior 2017
Luke Boosey Philip Brookins Dmitry Ryvkin

In many contest situations, the number of participants is not observable at the time of investment. We design a laboratory experiment to study individual behavior in Tullock (lottery) contests with group size uncertainty. There is a fixed pool of n potential players, each with independent probability q ∈ (0, 1] of participating. As shown by Lim and Matros (2009; Games and Economic Behavior, vol...

Journal: :Journal of Structural and Construction Engineering (Transactions of AIJ) 2001

2004
Paul Bartha

De Finetti would claim that we can make sense of a draw in which each positive integer has equal probability of winning. This requires a uniform probability distribution over the natural numbers, violating countable additivity. Countable additivity thus appears not to be a fundamental constraint on subjective probability. It does, however, seem mandated by Dutch Book arguments similar to those ...

Journal: :Proceedings of the National Academy of Sciences of the United States of America 1976
D B Mertz D A Cawthon T Park

This report reexamines experimentally the problem of competitive indeterminacy in mixed-species populations of the flour beetles, Tribolium confusum and T. castaneum. Indeterminacy takes the form of alternative competitive outcomes: in some replicate cultures one species exterminates the other with a probability, say p, whereas in others, the opposing species wins with a complementary probabili...

2006
Ling Zhao Martin Müller

Probabilistic combinatorial games (PCG) are a model for Go-like games recently introduced by Ken Chen. They differ from normal combinatorial games since terminal position in each subgame are evaluated by a probability distribution. The distribution expresses the uncertainty in the local evaluation. This paper focuses on the analysis and solution methods for a special case, 1-level binary PCG. M...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید