A new regularization of equilibrium problems on Hadamard manifolds: applications to theories of desires

In this paper, we introduce a new proximal algorithm for equilibrium problems on a genuine Hadamard manifold, using a new regularization term. We first extend recent existence results by considering pseudomonotone bifunctions and a weaker sufficient condition than the coercivity assumption. Then, we consider the convergence of this proximal-like algorithm which can be applied to genuinely Hadamard manifolds and not only to specific ones, as in the recent literature. A striking point is that our new regularization term have a clear interpretation in a recent “variational rationality” approach of human behavior. It represents the resistance to change aspects of such human dynamics driven by motivation to change aspects. This allows us to give an application to the theories of desires, showing how an agent must escape to a succession of temporary traps to be able to reach, at the end, his desires.

     

Maximal Elements Under Reference-Dependent Preferences with Applications to Behavioral Traps and Games

We study reference-dependent preference relations defined by a real-valued bivariate function and prove an existence criterion for maximal elements. Then we formulate a generalized version of the well-known Brondsted maximum principle and apply it to behavioral traps and Nash equilibrium in games with preference relations that are not necessarily partial orders.     

Pricing Behaviors on Networks: Some General Results for Two-way Networks

In this paper, we study monopolistic pricing behaviors within a two-way network. In this symbiotic production system, independent decision centers carry out an activity which concurs to the production of different system goods. The players are assumed to know the whole network. Due to this rationality, they try to capture a share of the profit of the firms who sell the system goods to the consumers. These double marginalization behaviors are studied within very general networks. Conditions with ensure existence and uniqueness are discussed. We even provided a complete characterization of an equilibrium. Potential applications are also discussed     

A proximal method with separable Bregman distances for quasiconvex minimization over the nonnegative orthant

We present an interior proximal method with Bregman distance, for solving the minimization problem with quasiconvex objective function under nonnegative constraints. The Bregman function is considered separable and zone coercive, and the zone is the interior of the positive orthant. Under the assumption that the solution set is nonempty and the objective function is continuously differentiable, we establish the well definedness of the sequence generated by our algorithm and obtain two important convergence results, and show in the main one that the sequence converges to a solution point of the problem when the regularization parameters go to zero.     

A tabu search scheme for abstract problems, with applications to the computation of fixed points

We present a general tabu search iterative algorithm to solve abstract problems on metric spaces. At each iteration, if the current solution turns out to be unacceptable then a neighborhood of unacceptable solutions is determined and excluded for further exploration, in such a way that, under mild assumptions, an acceptable solution is asymptotically reached. Thus our algorithm makes a crucial use of memory to avoid visiting unacceptable solutions more than once. We also present a specialization of our general method to the computation of fixed points.     

Variational rationality,variational principles and the existence of traps in a changing environment

Journal of Global Optimization - This paper has two aspects. Mathematically, in the context of global optimization, it provides the existence of an optimum of a perturbed optimization problem that...     

General Versions of the Ekeland Variational Principle: Ekeland Points and Stop and Go Dynamics

Journal of Optimization Theory and Applications - We establish general versions of the Ekeland variational principle (EVP), where we include two perturbation bifunctions to discuss and obtain...