Computing Normalized Equilibria in Convex-Concave Games

Abstract. This paper considers a fairly large class of noncooperative games in which strategies are jointly constrained. When what is called the Ky Fan or Nikaidô-Isoda function is convex-concave, selected Nash equilibria correspond to diagonal saddle points of that function. This feature is exploited to design computational algorithms for finding such equilibria. To comply with some freedom of individual choice the algorithms developed here are fairly decentralized. However, since coupling constraints must be enforced, repeated coordination is needed while underway towards equilibrium. Particular instances include zero-sum, two-person games - or minimax problems - that are convex-concave and involve convex coupling constraints.Noncooperative games; Nash equilibrium; joint constraints; quasivariational inequalities; exact penalty; subgradient projection; proximal point algorithm; partial regularization; saddle points; Ky Fan or Nikaidô-Isoda functions.

Random variational-like inclusion and random proximal operator equation for random fuzzy mappings in Banach spaces

In this paper, we introduce and study a random variational-like inclusion and its corresponding random proximal operator equation for random fuzzy mappings. It is established that the random variational-like inclusion problem for random fuzzy mappings is equivalent to a random fixed point problem. We also establish a relationship between random variational-like inclusion and random proximal operator equation for random fuzzy mappings. This equivalence is used to define an iterative algorithm for solving random proximal operator equation for random fuzzy mappings. Through an example, we show that the random Wardrop equilibrium problem is a special case of the random variational-like inclusion problem for random fuzzy mappings

Some recent advances in projection-type methods for variational inequalities

AbstractProjection-type methods are a class of simple methods for solving variational inequalities, especially for complementarity problems. In this paper we review and summarize recent developments in this class of methods, and focus mainly on some new trends in projection-type methods