Two-player knock 'em down.

Fill, James Allen; Wilson, David B.

Displaying similar documents to “Two-player knock 'em down.”

Uniformly accurate quantile bounds via the truncated moment generating function: the symmetric case.

Klass, Michael J., Nowicki, Krzysztof (2007)

Electronic Journal of Probability [electronic only]

Similarity:

On the approach to equilibrium for a polymer with adsorption and repulsion.

Caputo, Pietro, Martinelli, Fabio, Toninelli, Fabio Lucio (2008)

Electronic Journal of Probability [electronic only]

Similarity:

Strong average optimality criterion for continuous-time Markov decision processes

Qingda Wei, Xian Chen (2014)

Kybernetika

Similarity:

This paper deals with continuous-time Markov decision processes with the unbounded transition rates under the strong average cost criterion. The state and action spaces are Borel spaces, and the costs are allowed to be unbounded from above and from below. Under mild conditions, we first prove that the finite-horizon optimal value function is a solution to the optimality equation for the case of uncountable state spaces and unbounded transition rates, and that there exists an optimal...

Counting equivalence classes of irreducible representations.

Letzter, Edward S. (2001)

AMA. Algebra Montpellier Announcements [electronic only]

Similarity:

On the number of abelian groups of a given order (supplement)

Hong-Quan Liu (1993)

Acta Arithmetica

Similarity:

1. Introduction. The aim of this paper is to supply a still better result for the problem considered in [2]. Let A(x) denote the number of distinct abelian groups (up to isomorphism) of orders not exceeding x. We shall prove Theorem 1. For any ε > 0, $A (x) = C ₁ x + C ₂ x^{1 / 2} + C ₃ x^{1 / 3} + O (x^{50 / 199 + ε})$ , where C₁, C₂ and C₃ are constants given on page 261 of [2]. Note that 50/199=0.25125..., thus improving our previous exponent 40/159=0.25157... obtained in [2]. To prove Theorem 1, we shall proceed along the line of approach presented...