Abstract
In this paper, we consider the equilibrium problem with finite number of families of players such that each family may not have the same number of players and finite number of families of constrained correspondences on the strategy sets. We also consider the case with two finite families of constrained correspondences on the strategies sets. We demonstrate an example of our equilibrium problem. We derive a fixed point theorem for a family of multimaps and a coincidence theorem for two families of multimaps. By using these results, we establish the existence of a solution of our equilibrium problems. The results of this paper generalize some known results in the literature.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.