 # A Short Solution to the Many-Player Silent Duel with Arbitrary Consolation Prize

The classical constant-sum 'silent duel' game had two antagonistic marksmen walking towards each other. A more friendly formulation has two equally skilled marksmen approaching targets at which they may silently fire at distances of their own choice. The winner, who gets a unit prize, is the marksman who hits his target at the greatest distance; if both miss, they share the prize (each gets a 'consolation prize' of one half). In another formulation, if they both miss they each get zero. More generally we can consider more than two marksmen and an arbitrary consolation prize. This non-constant sum game may be interpreted as a research tournament where the entrant who successfully solves the hardest problem wins the prize. We give the first complete solution to the many-player problem with arbitrary consolation prize: moreover (by taking particular values for the consolation prize), our theorem incorporates various special results in the literature, and our proof is simpler than any of these.

## Authors

##### This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

## 1 Introduction

Suppose that a number of equally skilled competitors attempt a task whose level of difficulty can be varied – for example lifting a heavy barbell (vary the weight), jumping over a bar (vary the height), or proving a mathematical theorem (vary the theorem). Each competitor chooses his own level of difficulty and is allowed only one attempt, not knowing what levels the others are attempting nor whether they succeed or fail. The player who is successful at the highest level wins, or shares the prize if there is a tie. Of course, this protocol does not follow normal weight-lifting or high-jumping competition rules. However, it does give a simple model of a research tournament where entrants compete to find the best solution to a problem posed by a firm – better solutions being more difficult to find.

Another version of the problem would have a line of marksmen walking towards a set of targets (one for each player). They can choose to fire at any distance, and the attempt will either be a hit or a miss. The shots are silent, so the other players do not know who has fired, nor whether anyone has hit the target. A marksman who hits his target from the greatest distance is the winner, and again the prize is shared if there is a tie. If all fail (everyone misses), we could again say the prize is shared, which keeps it a constant-sum game, or give no prize, or give everyone a small consolation prize. (If all the players start by contributing to the prize pool, sharing the prize when all fail is reasonable.) Giving no consolation prize is the standard assumption for prize competitions (research tournaments).

When there are just two players we can assume the target is the other player, and they walk steadily towards each other. The game then becomes the classic game of timing known as the ‘silent duel’. The purpose of this note is to give a short and simple solution to this problem in the many-person case and for any level of the consolation prize.

Games of timing were first extensively studied at the RAND Corporation during the period 1948-1952, though some of the memorandums were only declassified later. Radzik (1996), who provides a detailed history (as well as more advanced analysis), cites David Blackwell together with M. Shiffman, M. A. Girshik, L. S. Shapley, R. Bellman, and I Glicksberg as some of the major researchers at that time. The silent duel is the exemplar of games of timing and is a staple example in the major texts on mathematical game theory (e.g. Owen (1995), Başar and Olsder (1982), and Garnaev (2000)). The area has seen significant development (noisy duels, many bullets, limited time horizon). Most of these extensions remain two person constant-sum games, with the exceptions of Sakaguchi (1977/78), Henig and O’Neill (1992), Baston and Garnaev (1995), and Presman and Sonin (2006) (who also allow for players with different marksmanship skills).

## 2 The model and solution

We have identical players, called marksmen. A pure strategy for each is a firing distance,

. We assume the probability of missing is

at maximum distance, and declines strictly and continuously as the range decreases, becoming zero when the range is zero. So we can measure the firing distance by the probability of missing,

. In a mixed strategy the firing distance will be a random variable

having a probability distribution specified by a (cumulative) distribution function

.

We now introduce a new random variable, the ‘score’ . The score is the same as the firing distance, , if the player hits the target (which has probability ), but equals if he misses (which has probability ). So the rules imply that the player with the highest score (who hits the target at the greatest distance) wins the prize, which we take to be . If there is a tie at a non-negative score the prize is divided equally among the winners. The event that all the marksmen miss, and get the same score of , has positive probability, and in this case we say that everyone gets the same ‘consolation prize’ of . If , which corresponds to the players splitting the prize, the game has constant sum . More specifically, if and , the game is the original silent duel. Setting to zero means that no prize is given for failure. A valid strategy is to fire at point-blank range, hoping all the other players have fired and missed. In this case the score is , but this is still better than a miss, so a miss must be assigned a negative score: the choice of is arbitrary – any negative number would do equally well.

A pure strategy for the firing distance (fire at distance ) gives rise to a two-atom distribution for the score ( with probability , and with probability ). A mixed strategy for the firing distance gives a mixture of these two-atom distributions for . Let be the distribution function for the score. will have an atom of probability, , at , but all the remaining probability will lie within . So and .

We note that if there is a density function for the firing distance, then (aside from the atom at ) there is a density for the score, satisfying

 f(x)=(1−x)g(x). (2.1)
###### Theorem 2.1.

Suppose with , and with . Let be the unique solution in of the polynomial

 (1p)n =1−nc+n(1p).

Then the -player silent duel game with compensation has a unique symmetric equilibrium in which each player has overall probability of missing, with equilibrium payoff , and with score distribution supported on , where

 F(y)=p(n−1√1−cy1−y), for 0⩽y⩽b=1−v1−cv. (2.2)
###### Proof.

Suppose that there is a symmetric equilibrium in which every player achieves expected value , has the score distribution , and has probability of missing . We note first that must be continuous on , because if there was an atom of probability at some distance this would imply that that the firing distribution also had an atom of probability at . But then if one player deviated by moving this atom to , for sufficiently small , she would obtain a larger expected payoff. This argument does not apply when , but the strategy of firing at maximum distance (when you are certain to miss) is dominated by firing at any shorter range.

If the first players adopt the score distribution , and the ’th player chooses to fire at any distance , she should get an expected payoff no greater than . As does not have an atom at , the chance that she ties with another player is zero. If she hits the target (which has probability then she wins with payoff if is greater than the other players’ successful firing distances, that is with probability . If she misses, she still gets the consolation prize if all the other players also miss. So her expected payoff is made up of these two terms, and so for we have

 (1−y)Fn−1(y)+cypn−1⩽v, (2.3)

giving

 F(y)⩽n−1√v−cypn−11−y. (2.4)

By assumption, there must be some -value(s) which give Player the equilibrium value . In fact, Player will be prepared to use values only where the inequality is binding. If the inequality is not binding at some point , there will be an interval including in which the inequality is not binding. Player will not be prepared to place any probability in this interval, and since we are assuming we have a symmetric equilibrium, the other players will do the same. So where is below the bounding curve it must be horizontal. If it touches the curve again at some larger value of , there must be an atom of probability to jump up to meet the curve again. But we saw that must be atomless. So the bound must be tight up to some value at which . Similarly there cannot be an atom of probability at , so .

Taking in the equation for gives

 v=Fn−1(0)=pn−1 (2.5)

This establishes that if there is a symmetric solution it must be of the form claimed. It remains to find values for and .

To find , we note that the expected total amount paid out must equal , but we also know that it is either if someone hits the target or else if everyone misses, so

 nv =(1−pn)1+pn(nc), npn−1 =1−pn+ncpn, np =(1p)n−1+nc, (1p)n =1−nc+n(1p).

Considered as an equation in , we are looking for the intersection of a line of slope with the curve which has slope at . Clearly there will be a unique solution greater than on the positive reals provided is less than .

For , we solve to get .

is differentiable on to give a score density function . We can then find the firing distance density as . A direct calculation then shows that this density does integrate to on , and that if every player uses this density for the firing distance, none will have an incentive to deviate unilaterally. ∎

### 2.1 Special cases

###### Proposition 2.2.

For the constant-sum case (share the prize if all fail), the equilibrium has the score distribution

 F(y)=n−1√n−yn2(1−y),for 0⩽y⩽b=nn+1, (2.6)

and the density for the firing distance is

 g(x)=1n−1√n2(1−x)2n−1(n−x)n−2 .
###### Proof.

If , the game has constant sum , so we have by the symmetry of the players. Then , which turns (2.2) into (2.6). is calculated as . ∎

So

 g(x)=14(1−x)3 (2.7)

gives the density of the firing distance in the classic silent duel (, ). The solution was published in Karlin (1959). A recent reference is Owen (1995). Alpern and Howard (2017) give an alternative treatment based on Distribution Ranking Games.

Figure 1 plots the firing distance densities for the cases (solid line), (dashed line), and (dotted line).

We have thus given a solution to the general constant-sum versions of the silent duel for multiple players. We can also calculate the equilibrium payoff (and hence the equilibrium distribution) in the case of ‘no prize for failure’.

###### Proposition 2.3.

For the prize competition case, , the equilibrium score distribution is given by

 F(y)=pn−1√1−y, for 0⩽y⩽b=1−v, (2.8)

where is the unique solution in of the polynomial

 (1p)n =1+n(1p).

The payoff .

###### Proof.

Taking in Theorem 2.1, we easily find that

 f(y)=pn−1(11−y)nn−1,

and so

 g(x)=pn−1(11−x)2n−1n−1.

Sakaguchi (1977/78) gives this equilibrium solution, and Henig and O’Neill (1992) show that it is the unique equilibrium. More recently Presman and Sonin (2006) have extended the analysis (making one assumption) to the case of many marksmen who may also have different accuracies.

Figure 2 plots the firing distance densities for the cases (solid line), (dashed line), and (dotted line).

## 3 Conclusion

We have given a very short solution to the many-player silent duel for with an arbitrary consolation prize. For different values of the consolation prize, our derivation gives or generalizes known results. Ours is the first solution for an arbitrary consolation prize.

## References

• Alpern and Howard (2017) Alpern, S. and J. V. Howard (2017): “Winner-Take-All Games: The Strategic Optimisation of Rank,” Operations Research, 65, 1165–1176.
• Başar and Olsder (1982) Başar, T. and G. J. Olsder (1982): Dynamic noncooperative game theory, vol. 160 of Mathematics in Science and Engineering, Academic Press, Inc. [Harcourt Brace Jovanovich, Publishers], New York-London.
• Baston and Garnaev (1995) Baston, V. J. and A. Y. Garnaev (1995): “Teraoka-type two-person nonzero-sum silent duel,” J. Optim. Theory Appl., 87, 539–552.
• Garnaev (2000) Garnaev, A. (2000): Search games and other applications of game theory, vol. 485 of Lecture Notes in Economics and Mathematical Systems, Springer-Verlag, Berlin.
• Henig and O’Neill (1992) Henig, M. and B. O’Neill (1992): “Games of Boldness, Where the Player Performing the Hardest Task Wins,” Oper. Res., 40, 76–86.
• Karlin (1959) Karlin, S. (1959): The Theory of Infinite Games, Addison-Wesley series in statistics, Addison-Wesley.
• Owen (1995) Owen, G. (1995): Game theory, Academic Press, Inc., San Diego, CA, third ed.
• Presman and Sonin (2006) Presman, E. and I. Sonin (2006): “The existence and uniqueness of Nash equilibrium point in an -player game “shoot later, shoot first!”,” Internat. J. Game Theory, 34, 185–205.
• Radzik (1996) Radzik, T. (1996): “Results and problems in games of timing,” in Statistics, probability and game theory, Inst. Math. Statist., Hayward, CA, vol. 30 of IMS Lecture Notes Monogr. Ser., 269–292.
• Sakaguchi (1977/78) Sakaguchi, M. (1977/78): “Marksmanship contests—non-zero-sum game of timing,” Math. Japon., 22, 585–596.