The Level Set Method Of Joó And Its Use In Minimax Theory

Hans Frenk and G. Kassay

Econometric Institute Research Papers from Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute

Abstract: In this paper we discuss the level set method of Joó and how to use it to give an elementary proof of the well-known Sion’s minimax result. Although this proof technique is initiated by Joó and based on the inter-section of upper level sets and a clever use of the topological notion of connectedness, it is not very well known and accessible for researchers in optimization. At the same time we simplified the original proof of Joó and give a more elementary proof of the celebrated Sion’s minimax theorem.

Keywords: Level set method; game theory; minimax theorem (search for similar items in EconPapers)
JEL-codes: C61 M M11 R4 (search for similar items in EconPapers)
Date: 2004-08-30
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://repub.eur.nl/pub/1537/ERS%202004%20045%20LIS.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ems:eureir:1537

Access Statistics for this paper

More papers in Econometric Institute Research Papers from Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute Contact information at EDIRC.
Bibliographic data for series maintained by RePub (peter.vanhuisstede@eur.nl this e-mail address is bad, please contact repec@repec.org).