Skip to Main content Skip to Navigation
Journal articles

A minmax theorem for concave-convex mappings with no regularity assumptions.

Abstract : We prove that zero-sum games with a concave-convex payoff mapping defined on a product of convex sets have a value as soon as the payoff mapping is bounded and one of the set is bounded and finite dimensional. In particular, no additional regularity assumption is required, such as lower or upper semicontinuity of the function or compactness of the sets. We provide several examples that show that our assumptions are minimal.
Complete list of metadatas

Cited literature [4 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00927071
Contributor : Guillaume Vigeral <>
Submitted on : Friday, January 10, 2014 - 5:41:54 PM
Last modification on : Thursday, June 25, 2020 - 8:11:20 AM
Document(s) archivé(s) le : Friday, April 11, 2014 - 3:05:23 AM

Files

MaxMinVP9.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00927071, version 1

Citation

Perchet Vianney, Guillaume Vigeral. A minmax theorem for concave-convex mappings with no regularity assumptions.. Journal of Convex Analysis, Heldermann, 2015, 22 (2), pp.537-540. ⟨hal-00927071⟩

Share

Metrics

Record views

323

Files downloads

737