相关论文: Exact edge landing probability for the bouncing co…

Within the context of stochastic probing with commitment, we consider the online stochastic matching problem; that is, the one sided online bipartite matching problem where edges adjacent to an online node must be probed to determine if…

Entropic risk (ERisk) is an established risk measure in finance, quantifying risk by an exponential re-weighting of rewards. We study ERisk for the first time in the context of turn-based stochastic games with the total reward objective.…

We present a new approach for studying the problem of optimal hedging of a European option in a finite and complete discrete-time market model. We consider partial hedging strategies that maximize the success probability or minimize the…

Balanced knockout tournaments are ubiquitous in sports competitions and are also used in decision-making and elections. The traditional computational question, that asks to compute a draw (optimal draw) that maximizes the winning…

The problem of the Rivlin cube is to determine the stability of all homogeneous equilibria of an isotropic incompressible hyperelastic body under equitriaxial dead loads. Here, we consider the stochastic version of this problem where the…

The random greedy algorithm for constructing a large partial Steiner-Triple-System is defined as follows. We begin with a complete graph on $n$ vertices and proceed to remove the edges of triangles one at a time, where each triangle removed…

Consider a random graph model where each possible edge $e$ is present independently with some probability $p_e$. Given these probabilities, we want to build a large/heavy matching in the randomly generated graph. However, the only way we…

In the game of Matching Pennies, Alice and Bob each hold a penny, and at every tick of the clock they simultaneously display the head or the tail sides of their coins. If they both display the same side, then Alice wins Bob's penny; if they…

Consider $n$ independent, biased coins, each with a known probability of heads. Presented with an ordering of these coins, flip (i.e., toss) each coin once, in that order, until we have observed both a *head* and a *tail*, or flipped all…

In this article an analytical solution of equations of motion of a rigid disk of finite thickness rolling on its edge on a perfectly rough horizontal plane under the action of gravity is given. The solution is given in terms of Gauss…

A fundamental aspect of the three-body problem is its stability. Most stability studies have focused on the co-planar three-body problem, deriving analytic criteria for the dynamical stability of such pro/retrograde systems. Numerical…

Let $q \in (0,1)$ and $\delta \in (0,1)$ be real numbers, and let $C$ be a coin that comes up heads with an unknown probability $p$, such that $p \neq q$. We present an algorithm that, on input $C$, $q$, and $\delta$, decides, with…

Calculations and mechanistic explanations for the probabilistic movement of objects at the highly relevant cm length scales has been lacking and overlooked due to the complexity of current techniques. Predicting the final-configuration…

The best arm identification problem requires identifying the best alternative (i.e., arm) in active experimentation using the smallest number of experiments (i.e., arm pulls), which is crucial for cost-efficient and timely decision-making…

The three-body problem is arguably the oldest open question in astrophysics, and has resisted a general analytic solution for centuries. Various implementations of perturbation theory provide solutions in portions of parameter space, but…

Comprehensive and physically consistent model of a tossed coin is presented in terms of geometric algebra. The model clearly shows that there is nothing elementary particle specific in the half-spin quantum mechanical formalism. It also…

The system of falling balls is an autonomous Hamiltonian system with a smooth invariant measure and non-zero Lyapunov exponents almost everywhere. For almost three decades new, the question of its ergodicity remains open. We contribute to…

We present the algorithmic procedure determining the impulsive behavior of a rigid disk having a single or possibly multiple frictionless impact with two walls forming a corner. The algorithmic procedure represents an application of the…

We introduce a new family of one-player games, involving the movement of coins from one configuration to another. Moves are restricted so that a coin can be placed only in a position that is adjacent to at least two other coins. The goal of…

We study triples of labeled dice in which the relation "is a better die than" is non-transitive. Focusing on such triples with an additional symmetry we call "balance," we prove that such triples of $n$-sided dice exist for all $n \geq 3$.…