A representation theorem for minmax regret policies

DOI10.1016/j.artint.2006.11.001zbMath1168.68579OpenAlexW2137917163WikidataQ62042757 ScholiaQ62042757MaRDI QIDQ1028893

Sanjiang Li

Publication date: 9 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2006.11.001

zbMATH Keywords

maximincompetitive ratiominmax regretpolicyqualitative decision

Mathematics Subject Classification ID

Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (1)

A semi-dynamical approach for solving qualitative spatial constraint satisfaction problems

Cites Work

• Unnamed Item
• Shortest paths without a map
• Qualitative decision theory with preference relations and comparative uncertainty: an axiomatic approach
• Preference rankings in the face of uncertainty
• An axiomatic treatment of three qualitative decision criteria

This page was built for publication: A representation theorem for minmax regret policies