From deterministic to stochastic equilibrium problems
Abstract
In this paper, by means of Castaing representation Theorem, we extend
the results by M. Ait Mansour, R-.A. Elakri and M. Laghdir [Equilibrium
and quasi-equilibrium problems under j-quasimonotonicity and
j-quasiconvexity, Existence, stability and applications, Minimax Theory
and its Applications, 2 (2) (2017), 175–229] to random equilibrium problems
wherein the objective data are subject to a random perturbation. We
obtain deterministic as well as random (or measurable) and integral solutions
to random equilibrium problems. The case when the random parameter
has a probability of realization suggests us to introduce stochastic
formulations of equilibria covering the expected value approach and the
almost sure method. Thus, we prove the existence of two further kinds of
equilibria under uncertainty: almost sure solutions and expected stochastic
equilibrium points. Finally, we present an application to stochastic
quasiconvex programming for which we establish the existence of almost
sure minimizers.
Entrato
Downloads
Published
Issue
Section
License
The authors retain all rights to the original work without any restrictions.
License for Published Contents
"Le Matematiche" published articlesa are distribuited with Creative Commons Attribution 4.0 International. You are free to copy, distribute and transmit the work, and to adapt the work. You must attribute the work in the manner specified by the author or licensor (but not in any way that suggests that they endorse you or your use of the work).
License for Metadata
"Le Matematiche" published articles metadata are dedicated to the public domain by waiving all publisher's rights to the work worldwide under copyright law, including all related and neighboring rights, to the extent allowed by law.
You can copy, modify, distribute and perform the work, even for commercial purposes, all without asking permission.
No Fee Charging
No fee is required to complete the submission/review/publishing process of authors paper.