2 Ergebnisse.

The structure of a Silverman game can be explained very quickly: Each of two players independently selects a number out of a prede­ termined set, not necessarily the same one for both of them. The higher number wins unless it is at least k times as high as the other one, if this is the case the lower number wins. The game ends in a draw if both numbers are equal. k is a constant greater than 1. The simplicity of the rules stimulates the curios...

A Silverman game is a two-person zero-sum game defined in terms of two sets S I and S II of positive numbers, and two parameters, the threshold T > 1 and the penalty v > 0. Players I and II independently choose numbers from S I and S II, respectively. The higher number wins 1, unless it is at least T times as large as the other, in which case it loses v. Equal numbers tie. Such a game might be used to model various bidding or spending situatio...