Approximate saddle points for minmax problems and vector valued games

Approximate saddle points for minmax problems and vector valued games

0.00 Avg rating0 Votes
Article ID: iaor20041731
Country: India
Volume: 40
Issue: 1
Start Page Number: 1
End Page Number: 10
Publication Date: Mar 2003
Journal: OPSEARCH
Authors: ,
Abstract:

In this paper, we study approximate saddle points in the context of vector-valued games with multiple objectives. Some of the decision-making sets introduced earlier by White have been generalized to take care of approximate saddle point problems in the context of vector-valued games. Some examples are also given. Finally, some questions regarding stability properties of programs in the present context have been defined.

Reviews

Required fields are marked *. Your email address will not be published.