Abstract
Let\({\rm{\Gamma }} = \{ {\sum _{N,}}{K_1},...,{K_N}\}\) be the mixed extension of a finite n-person game (not necessarily zero-sum!). Based on the notion of primitive sets first defined and studied by Scarf [153], an interesting combinatorial algorithm was developed by Hansen for approximating an equilibrium point of [65].
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
© 1985 Akadémiai Kiadó, Budapest, Hungary
About this chapter
Cite this chapter
Szép, J., Forgó, F. (1985). The Scarf—Hansen algorithm for approximating and equilibrium point of a finite n-person game. In: Introduction to the Theory of Games. Mathematics and Its Applications, vol 17. Springer, Dordrecht. https://doi.org/10.1007/978-94-009-5193-8_5
Download citation
DOI: https://doi.org/10.1007/978-94-009-5193-8_5
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-8796-4
Online ISBN: 978-94-009-5193-8
eBook Packages: Springer Book Archive