Using pairings of male crayfish Procambarus clarkii with a 3-7% difference in size, we confirmed that physically larger crayfish were more likely to win encounters (winning probability of over 80%). Despite a physical disadvantage, small winners of the first pairings were more likely to win their subsequent conflicts with larger naive animals (winning probability was about 70%). By contrast, th...

Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decisionmaking and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning probability for a distinguished player, has received a lot of attention. Previous works consider the problem where the pairwise winning probabilities are known precisel...

civil procedure code in articles 424 and 437 has laid down deferenteffects for rehearing and objection to judgment by a third party aboutexecution of judgment. on base of these articles effect of rehearing isstronger, so with rendering of writ of acceptance of rehearing, execution ofjudgment stops, except about condemnation connected with property, whenobtaining of security with compensation is...

The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph...

The theory of graph games with ω-regular winning conditions is the foundation for modeling and synthesizing reactive processes. In the case of stochastic reactive processes, the corresponding stochastic graph games have three players, two of them (System and Environment) behaving adversarially, and the third (Uncertainty) behaving probabilistically. We consider two problems for stochastic graph...

We consider two-player games which are played on a finite state space for an infinite number of rounds. The games are concurrent, that is, in each round, the two players choose their moves independently and simultaneously; the current state and the two moves determine a successor state. We consider omega-regular winning conditions on the resulting infinite state sequence. To model the independe...

We consider two-player games played over finite state spaces for an infinite number of rounds. At each state, the players simultaneously choose moves; the moves determine a successor state. It is often advantageous for players to choose probability distributions over moves, rather than single moves. Given a goal (e.g., " reach a target state "), the question of winning is thus a probabilistic o...