Noncooperative Convex Games: Computing Equilibrium by Partial Regularization
A class of non-cooperative constrained games is analysed for which the Ky Fan fuction is convex-concave. Nash equilibria of such games correspond to diagonal saddle points of the said function. This feature is exploited in designing computational algorithms for finding such equilibria.
To our knowledge, this item is not available for
download. To find whether it is available, there are three
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
|Date of creation:||2000|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: http://www.uib.no/econ/
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- M.J. Kallio & A. Ruszczynski, 1994. "Perturbation Methods for Saddle Point Computation," Working Papers wp94038, International Institute for Applied Systems Analysis.
When requesting a correction, please mention this item's handle: RePEc:fth:bereco:1200. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Thomas Krichel)
If references are entirely missing, you can add them using this form.