Abstract
There are four types of dominance which allow us to simplify Silverman’s game on discrete sets. Although some are applicable to the game on arbitrary strategy sets, discrete or not, we will be making use of them primarily in the game on discrete sets. Two of the types, are applicable only when v ≥ 1, and although the other two do not depend on this assumption, most of our results on reduction of discrete games are for games with v ≥ 1.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Heuer, G.A., Leopold-Wildburger, U. (1995). Reduction by Dominance. In: Silverman’s Game. Lecture Notes in Economics and Mathematical Systems, vol 424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-46819-3_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-46819-3_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59232-7
Online ISBN: 978-3-642-46819-3
eBook Packages: Springer Book Archive