Multi-leader-follower potential games

In this paper, we discuss a particular class of Nash games, where the participants of the game (the players) are divided into two groups (leaders and followers) according to their position or influence on the other players. Moreover, we consider the case, when the leaders’ and/or the followers’ game can be described as a potential game. This is a subclass of Nash games that has been introduced by Monderer and Shapley in 1996 and has beneficial properties to reformulate the bilevel Nash game. We develope necessary and sufficient conditions for Nash equilibria and present existence and uniqueness results. Furthermore, we discuss some Examples to illustrate our results. In this paper, we discussed analytical properties for multi-leader follower potential games, that form a subclass of hierarchical Nash games. The application of these theoretical results to various fields of applications are a future research topic. Moreover, they are meant to serve as a starting point for the developement of efficient numerical solution methods for multi-leader-follower games.

Prioritized optimization by Nash games : towards an adaptive multi-objective strategy

This work is part of the development of a two-phase multi-objective differentiable optimization method. The first phase is classical: it corresponds to the optimization of a set of primary cost functions, subject to nonlinear equality constraints, and it yields at least one known Pareto-optimal solution xA*. This study focuses on the second phase, which is introduced to permit to reduce another set of cost functions, considered as secondary, by the determination of a continuum of Nash equilibria, {x̅ε} (ε≥ 0), in a way such that: firstly, x̅0=xA* (compatibility), and secondly, for ε sufficiently small, the Pareto-optimality condition of the primary cost functions remains O(ε2), whereas the secondary cost functions are linearly decreasing functions of ε. The theoretical results are recalled and the method is applied numerically to a Super-Sonic Business Jet (SSBJ) sizing problem to optimize the flight performance.

The replicator dynamics of generalized Nash games

Generalized Nash Games are a powerful modelling tool, first introduced in the 1950's. They have seen some important developments in the past two decades. Separately, Evolutionary Games were introduced in the 1960's and seek to describe how natural selection can drive phenotypic changes in interacting populations. In this paper, we show how the dynamics of these two independently formulated models can be linked under a common framework and how this framework can be used to expand Evolutionary Games. At the center of this unified model is the Replicator Equation and the relationship we establish between it and the lesser known Projected Dynamical System.

On the SQH Method for Solving Differential Nash Games

A sequentialquadratic Hamiltonian schemefor solving open-loop differential Nash games is proposed and investigated. This method is formulated in the framework of the Pontryagin maximum principle and represents an efficient and robust extension of the successive approximations strategy for solving optimal control problems. Theoretical results are presented that prove the well-posedness of the proposed scheme, and results of numerical experiments are reported that successfully validate its computational performance.

On a Class of Differential Variational Inequalities in Infinite-Dimensional Spaces

A new class of differential variational inequalities (DVIs), governed by a variational inequality and an evolution equation formulated in infinite-dimensional spaces, is investigated in this paper. More precisely, based on Browder’s result, optimal control theory, measurability of set-valued mappings and the theory of semigroups, we establish that the solution set of DVI is nonempty and compact. In addition, the theoretical developments are accompanied by an application to differential Nash games.

Image retrieval using Nash equilibrium and Kalai-Smorodinsky solution

In this paper, we propose a new formulation of Nash games for solving a general multi-objectives optimization problems. The objective of this approach is to split the optimization variables, allowing us to determine numerically the strategies between two players. The first player minimizes his function cost using the variables of the first table P and the second player, using the second table Q. The original contribution of this work concerns the construction of the two tables of allocations that lead to a Nash equilibrium on the Pareto front. The second proposition of this paper is to find a Nash Equilibrium solution, which coincides with the Kalai--Smorodinsky solution. Two algorithms that calculate P, Q and their associated Nash equilibrium, by using some extension of the normal boundary intersection approach, are tried out successfully. Then, we propose a search engine to look for similar images of a given image based on multiple image representations using Color, Texture and Shape Features.