Dynamics of stochastic and nearly stochastic two-party competitions

We introduce a stochastic model to study the problem of time evolution and outcome of simple two-party competitions or battles on a lattice where each party randomly deploys its constituents or elements to the lattice. The elements have assigned strength levels that determine how competitive or effective they are against the opponent. In our models, the elements neutralize one another when they are at the same site with a combination of strength levels and numbers determining which one gains control of the site. The competitions last until complete dominance has been established by one side by eliminating the opponents or a draw is achieved (unless the time evolution is terminated via some ad hoc condition). A Markov chain approach is used to describe the time-dependent dynamics of such competitions. The advantage of the approach is that it allows us to develop a theoretical framework for describing competitive systems where a combination of random and correlated events decide the outcome. We use the approach here for studies of highly contentious stochastic battles and for that of a battle with correlated events along with stochastic events. We present the method, a simple illustrative example on how the method works and close by considering two non-trivial cases including one with a combination of stochasticity and correlations.