Approximate saddle points for minmax problems and vector valued games.

DOI10.1007/BF03399195zbMath1210.91009OpenAlexW2776720441MaRDI QIDQ2477080

R. N. Mukherjee, L. Venkateswara Reddy

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

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

Related Items

Approximate saddle points for constrained vector-valued games.

Cites Work

• Characterizations of efficient sets by constrained objectives
• Epsilon efficiency
• Multi-objective infinite-horizon discounted Markov decision processes
• Duality theory in multiobjective programming
• Constrained vector valued games and generalized multiobjective minmax programming
• Approximate saddle points for constrained vector-valued games.
• Unnamed Item
• Unnamed Item