On optimal decisions under complete ignorance. A new criterion stronger than both Pareto and Maxmin

DOI10.1016/0377-2217(77)90062-5zbMath0369.90141OpenAlexW1567402378MaRDI QIDQ1243258

Fred Alois Behringer

Publication date: 1977

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(77)90062-5

Mathematics Subject Classification ID

2-person games (91A05) Utility theory (91B16) Decision theory for games (91A35)

Related Items (5)

Selecting preferred solutions in the minimax approach to dynamic programming problems under flexible constraints ⋮ A simplex based algorithm for the lexicographically extended linear maxmin problem ⋮ Conjoint axiomatization of Min, DiscriMin and LexiMin ⋮ A local version of Karamardian's theorem on lower semicontinuous strictly quasiconvex functions ⋮ Computing improved optimal solutions to max-min flexible constraint satisfaction problems

Cites Work

• Lexicographic quasiconcave multiobjective programming
• The Theory of Statistical Decision
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On optimal decisions under complete ignorance. A new criterion stronger than both Pareto and Maxmin