Abstract
In a symmetric Silverman game each of the two players chooses a number from a set S⊂(0,∞). The player with the larger number wins 1, unless the larger is at least T times as large as the other, in which case he loses v. Such games are investigated for discrete S, for T>1 and v>0. Except for v too near zero, where there is a proliferation of cases, explicit solutions are obtained. These are of finite type and, except at certain boundary cases, unique.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
