Abstract
A Silverman game is a two person zero sum game defined in terms of two sets, S1 and S2, of positive numbers and two parameters, the threshold T > 1 and the penalty ν > 0. Players I and II choose numbers independently from S1 and S2, respectively. The higher number wins 1, unless it is at least T times as large as the other, in which case it loses ν. If the numbers are equal the payoff is zero.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Heuer, G.A., Leopold-Wildburger, U. (1991). Introduction. In: Balanced Silverman Games on General Discrete Sets. Lecture Notes in Economics and Mathematical Systems, vol 365. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-95663-8_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-95663-8_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54372-5
Online ISBN: 978-3-642-95663-8
eBook Packages: Springer Book Archive