abstract traumatic rupture of the distal biceps tendon is rare. conservative treatment can result in reduced flexion and supination power with reduced function. this case report emphasizes the need for prompt surgical treatment and describes the possible complications of delayed surgical intervention.

We consider a dynamic game where additional players (assumed identical, even if there will be a mild departure from that hypothesis) join the game randomly according to a Bernoulli process. The problem solved here is that of computing their expected payoff as a function of time and the number of players present when they arrive, if the strategies are given. We consider both a finite horizon gam...

With the increasing diversity of Distributed Denial-of-Service (DDoS) attacks, it is becoming extremely challenging to design a fully protected network. For instance, Stealthy Link Flooding Attack (SLFA) variant DDoS attacks that strives block access target area by flooding small set links, and shown can bypass traditional defense mechanisms. One potential solution tackle such SLFAs apply Movin...

In this study, we investigate how dynamic features of communication are realized in simulated processes. We hypothesize that ambiguity and context play important roles for maintaining the dynamics of success and failure in communication. We propose a game model of communication by adding ambiguity and context to Steels’ Language-Game. As a result of simulation experiments of two types of the ga...

We consider a discrete-time dynamic game in which a finite number of players extract a non-renewable resource and derive consumption solely from the extracted amount (cake-eating game). Markov-perfect Nash equilibria can be constructed in this game not only if the players have time-preference factors that are smaller than 1, but also if these factors are equal to or even larger than 1. We demon...

We consider a two-player partial-information game on a Markov chain, where each player attempts to minimize its own cost over a finite time horizon. We show that this game has always a Nash equilibrium in stochastic behavioral policies. The technique used to prove this result is constructive but has severe limitations because it involves solving an extremely large bi-matrix game. To alleviate t...

This paper deals with a polling game on a graph. Initially, each vertex is colored white or black. At each round, each vertex is colored by the color shared by the majority of vertices in its neighborhood. (All recolorings are done simultaneously). We say that a set W0 of vertices is a dynamic monopoly or dynamo if starting the game with the vertices ofW0 colored white, the entire system is whi...