Sublevel sets of invex functions are connected under mild assumptions, with the result extended to solution sets in invex-incave minimax problems and incave games.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
Characterizes iterated admissibility via the 'all I know' operator, first with LPSs to address Samuelson's concern and then with approximate belief and approximate 'all I know' in standard probability structures.
citing papers explorer
-
On the Connectedness of Sublevel Sets in Invex Optimization
Sublevel sets of invex functions are connected under mild assumptions, with the result extended to solution sets in invex-incave minimax problems and incave games.
-
A Conceptually Well-Founded Characterization of Iterated Admissibility Using an "All I Know" Operator
Characterizes iterated admissibility via the 'all I know' operator, first with LPSs to address Samuelson's concern and then with approximate belief and approximate 'all I know' in standard probability structures.