Sjur Didrik Flåm () and A. Ruszczynski ()
Additional contact information
Sjur Didrik Flåm: University of Bergen, Department of Economics, Postal: Hermann Fossgt. 6, N-5007 Bergen, Norway
A. Ruszczynski: Rutgers University, Department of Management Science and Information Systems
Abstract: 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.
Keywords: 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.
15 pages, April 26, 2006
Full text files
No.%2005-06.pdf Full text
Questions (including download problems) about the papers in this series should be directed to Kjell Erik Lommerud ()
Report other problems with accessing this service to Sune Karlsson ().
RePEc:hhs:bergec:2006_005This page generated on 2024-10-27 22:37:47.