Abstract
We apply the selection theorem for multivalued mappings with paraconvex values (rather than various versions of KKM-principle) to prove several minimax theorems. In contrast with well-known minimax theorems for coordinatewise semicontinuous functions, in our theorems finite intersections of sublevel or uplevel sets can be nonempty and nonconnected.
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.
