Sounds like Banker bot

Eureka Alert: "Our algorithm can potentially be used to compute the best resource investment strategy for any competitor up against a single opponent," said Mohammad Hajiaghayi, the Jack and Rita G. Minker Associate Professor of Computer Science at UMD and lead on the project. "As long as we have sufficient data on a given scenario, we can use our algorithm to find the best strategy for a wide variety of leaders, such as political candidates, sports teams, companies and military leaders."

We got ourselves an interesting read.  We have Microsoft, in this group, an d that language sounds like their cloud customers, all the big banks, will be interested.  They got move rules on a board game, a probabilistic grammar, a random spanning tree, or they got encode/decode working, and they do queuing on a surface simulating pi, por they got the fermion/boson thing going.

We have to read this, boys and girls over in Silicon Valley, and those folks doing ethereum be  mighty interested.  Does this sound like a double sided Black/Scholes?

Here is the game:

Colonel Blotto's Game

Game theory allows social scientists to formalize the study of strategic interactions, bringing the deductive logic of math to bear on problems that require us to consider counter-factual realities. The Colonel Blotto Game is an encoding of an important competitive situation which inspired many early game theorists and yet is still not fully understood. The game’s value as a model is evident through the large domain of relevant scenarios which resemble its basic structure.

Colonel Blotto's Game is a zero sum game well known to game theory enthusiasts. In fact , Colonel Blotto  along with the Prisoner’s Dilemma propelled game theory into the real politick of international relations (Golman and Page 2007). So what is a Colonel Blotto Game?

 A simple version of the game s is played between two antagonists, A and B (see the box "Who Was Blotto?"). Colonel Blotto, leader of the A forces, battles with Colonel Sanders , commander of the B forces, for control of a number of passes through a mountain range that separates the two armies.

Blotto commands N units of military force, while Sanders disposes of M units. Each leader allocates his or her units among the mountain passes: some to pass 1, some to pass 2, so some to pass 3, and so on. On the day of confrontation, control of a pass is won by the side with more units of force at that location. If the two forces at a pass are equal, neither side gains control of the pass. Each side gains a point for each pass it controls and loses a point for each pass controlled by the opponent. The sum of the two sides' scores is therefore zero. Hence, Colonel Blotto's Game is TPZS.

Blotto disposes his forces to maximize his gain and Sanders his forces to minimize his loss. For our purposes, the salient aspects of a Blotto game are as follows:

(1) Each commander has finite resources that are partitioned among a limited number of sites (i.e. passes) and any unused resources have no value.

(2) The gain resulting from the confrontation at a site depends only on the local forces. That is, conditions at one site do not influence the outcome at another.

(3) Passes are equally valuable

Hey, that is a queuing model, waddya now.