Approximate saddle points for minmax problems and vector valued games.

DOI10.1007/BF03399195MaRDI QIDQ2477080zbMATH OpenOpenAlexFDO

Authors L. Venkateswara Reddy, R. N. Mukherjee

Publication date 13 March 2008

Published in Opsearch (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf03399195

zbMATH Keywords

approximate saddle pointsdecision making setsmulti-criteria of games

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Noncooperative games (91A10)

Cites work

• Approximate saddle points for constrained vector-valued games.
• Characterizations of efficient sets by constrained objectives
• Constrained vector valued games and generalized multiobjective minmax programming
• Duality theory in multiobjective programming
• Epsilon efficiency
• scientific article; zbMATH DE number 3433785 (Why is no real title available?)
• scientific article; zbMATH DE number 3310599 (Why is no real title available?)
• Multi-objective infinite-horizon discounted Markov decision processes

Cited in

(1)

• Approximate saddle points for constrained vector-valued games.

This page was built for publication: Approximate saddle points for minmax problems and vector valued games.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477080)